| 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 20256. (Contributed by FL, 13-Feb-2010.) (Revised by AV, 25-Jan-2020.) |
| Ref | Expression |
|---|---|
| en1eqsnbi | ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o ↔ 𝐵 = {𝐴})) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | en1eqsn 9231 | . . 3 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝐵 ≈ 1o) → 𝐵 = {𝐴}) | |
| 2 | 1 | ex 417 | . 2 ⊢ (𝐴 ∈ 𝐵 → (𝐵 ≈ 1o → 𝐵 = {𝐴})) |
| 3 | ensn1g 9015 | . . 3 ⊢ (𝐴 ∈ 𝐵 → {𝐴} ≈ 1o) | |
| 4 | breq1 5112 | . . 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 1570 ∈ wcel 2143 {csn 4589 class class class wbr 5109 1oc1o 8442 ≈ cen 8936 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1825 ax-4 1839 ax-5 1940 ax-6 1997 ax-7 2038 ax-8 2145 ax-9 2153 ax-10 2176 ax-12 2213 ax-ext 2735 ax-sep 5257 ax-nul 5269 ax-pr 5404 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1810 df-nf 1814 df-sb 2097 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-ne 2959 df-ral 3080 df-rex 3090 df-reu 3370 df-rab 3417 df-v 3457 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4488 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-br 5110 df-opab 5174 df-id 5556 df-xp 5667 df-rel 5668 df-cnv 5669 df-co 5670 df-dm 5671 df-rn 5672 df-res 5673 df-ima 5674 df-suc 6366 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-1o 8449 df-en 8940 |
| This theorem is referenced by: rngen1zr 20256 srgen1zr0 20293 rngosn4 38576 |
| Copyright terms: Public domain | W3C validator |