| 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 20710. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.) |
| Ref | Expression |
|---|---|
| en1eqsnbi | ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en1eqsn 9175 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ≈ 1o) → 𝐵 = {𝐴}) | |
| 2 | 1 | ex 412 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o → 𝐵 = {𝐴})) |
| 3 | ensn1g 8959 | . . 3 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ≈ 1o) | |
| 4 | breq1 5101 | . . 3 ⊢ (𝐵 = {𝐴} → (𝐵 ≈ 1o ↔ {𝐴} ≈ 1o)) | |
| 5 | 3, 4 | syl5ibrcom 247 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 = {𝐴} → 𝐵 ≈ 1o)) |
| 6 | 2, 5 | impbid 212 | 1 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴})) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1541 ∈ wcel 2113 {csn 4580 class class class wbr 5098 1oc1o 8390 ≈ cen 8880 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-12 2184 ax-ext 2708 ax-sep 5241 ax-nul 5251 ax-pr 5377 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-ne 2933 df-ral 3052 df-rex 3061 df-reu 3351 df-rab 3400 df-v 3442 df-dif 3904 df-un 3906 df-in 3908 df-ss 3918 df-nul 4286 df-if 4480 df-sn 4581 df-pr 4583 df-op 4587 df-uni 4864 df-br 5099 df-opab 5161 df-id 5519 df-xp 5630 df-rel 5631 df-cnv 5632 df-co 5633 df-dm 5634 df-rn 5635 df-res 5636 df-ima 5637 df-suc 6323 df-iota 6448 df-fun 6494 df-fn 6495 df-f 6496 df-f1 6497 df-fo 6498 df-f1o 6499 df-fv 6500 df-1o 8397 df-en 8884 |
| This theorem is referenced by: srgen1zr 20151 rngen1zr 20710 rngosn4 38126 |
| Copyright terms: Public domain | W3C validator |