| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > elsng | GIF version | ||
| Description: There is exactly one element in a singleton. Exercise 2 of [TakeutiZaring] p. 15 (generalized). (Contributed by NM, 13-Sep-1995.) (Proof shortened by Andrew Salmon, 29-Jun-2011.) |
| Ref | Expression |
|---|---|
| elsng | ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqeq1 2238 | . 2 ⊢ (𝑥 = 𝐴 → (𝑥 = 𝐵 ↔ 𝐴 = 𝐵)) | |
| 2 | df-sn 3675 | . 2 ⊢ {𝐵} = {𝑥 ∣ 𝑥 = 𝐵} | |
| 3 | 1, 2 | elab2g 2953 | 1 ⊢ (𝐴 ∈ 𝑉 → (𝐴 ∈ {𝐵} ↔ 𝐴 = 𝐵)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ↔ wb 105 = wceq 1397 ∈ wcel 2202 {csn 3669 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-io 716 ax-5 1495 ax-7 1496 ax-gen 1497 ax-ie1 1541 ax-ie2 1542 ax-8 1552 ax-10 1553 ax-11 1554 ax-i12 1555 ax-bndl 1557 ax-4 1558 ax-17 1574 ax-i9 1578 ax-ial 1582 ax-i5r 1583 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1400 df-nf 1509 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-nfc 2363 df-v 2804 df-sn 3675 |
| This theorem is referenced by: elsn 3685 elsni 3687 snidg 3698 eltpg 3714 eldifsn 3800 elsucg 4501 funconstss 5765 fniniseg 5767 fniniseg2 5769 tpfidceq 7121 fidcenumlemrks 7151 ltxr 10009 elfzp12 10333 1exp 10829 imasaddfnlemg 13396 0subm 13566 0subg 13785 0nsg 13800 kerf1ghm 13860 lsssn0 14383 plycj 15484 2lgslem2 15820 |
| Copyright terms: Public domain | W3C validator |