Playground Documentation Challenges Full Docs
← All Challenges

#35. Singletons Are Injective

Medium T[…] lock quantifiers

A set e is the singleton of a when ∀({t: 𝕊 | ⇔(∈(t, e), =(t, a))}) -> ✔ — membership in e means being equal to a. Suppose the same set e is a singleton of a and also a singleton of b. Prove =(a, b) -> ✔.

You have reflexivity of equality (A=Reflexive) and two biconditional tools: T!⇔✔✔ extracts the left side of a true ⇔ whose right side is true, and T✔⇔!✔ extracts the right side when the left is true. Five commands suffice.

Hint

Instantiate the first criterion at a: EA[a] gives ⇔(∈(a, e), =(a, a)) -> ✔. Reflexivity makes the right side true, so T!⇔✔✔[∈(a, e), =(a, a)] yields ∈(a, e) -> ✔. Now instantiate the second criterion at a and extract the other way with T✔⇔!✔.

Your Solution
Output