| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > en1eqsnbi | Structured version Visualization version GIF version | ||
| Description: A set containing an element has exactly one element iff it is a singleton. Formerly part of proof for rngen1zr 20260. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.) |
| Ref | Expression |
|---|---|
| en1eqsnbi | ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en1eqsn 9234 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ≈ 1o) → 𝐵 = {𝐴}) | |
| 2 | 1 | ex 417 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o → 𝐵 = {𝐴})) |
| 3 | ensn1g 9018 | . . 3 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ≈ 1o) | |
| 4 | breq1 5116 | . . 3 ⊢ (𝐵 = {𝐴} → (𝐵 ≈ 1o ↔ {𝐴} ≈ 1o)) | |
| 5 | 3, 4 | syl5ibrcom 250 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 = {𝐴} → 𝐵 ≈ 1o)) |
| 6 | 2, 5 | impbid 215 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 = wceq 1567 ∈ wcel 2149 {csn 4594 class class class wbr 5113 1oc1o 8445 ≈ cen 8939 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-12 2219 ax-ext 2741 ax-sep 5261 ax-nul 5271 ax-pr 5405 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-ne 2965 df-ral 3086 df-rex 3096 df-reu 3377 df-rab 3424 df-v 3465 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-br 5114 df-opab 5178 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-suc 6367 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-1o 8452 df-en 8943 |
| This theorem is referenced by: rngen1zr 20260 srgen1zr0 20297 rngosn4 38463 |
| Copyright terms: Public domain | W3C validator |