| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > en0 | Structured version Visualization version GIF version | ||
| Description: The empty set is equinumerous only to itself. Exercise 1 of [TakeutiZaring] p. 88. (Contributed by NM, 27-May-1998.) Avoid ax-pow 5326, ax-un 7734. (Revised by BTernaryTau, 23-Sep-2024.) |
| Ref | Expression |
|---|---|
| en0 | ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | encv 8959 | . . . . 5 ⊢ (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V)) | |
| 2 | breng 8960 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴–1-1-onto→∅)) | |
| 3 | 1, 2 | syl 18 | . . . 4 ⊢ (𝐴 ≈ ∅ → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴–1-1-onto→∅)) |
| 4 | 3 | ibi 270 | . . 3 ⊢ (𝐴 ≈ ∅ → ∃𝑓 𝑓:𝐴–1-1-onto→∅) |
| 5 | f1ocnv 6825 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→𝐴) | |
| 6 | f1o00 6848 | . . . . . 6 ⊢ (◡𝑓:∅–1-1-onto→𝐴 ↔ (◡𝑓 = ∅ ∧ 𝐴 = ∅)) | |
| 7 | 6 | simprbi 503 | . . . . 5 ⊢ (◡𝑓:∅–1-1-onto→𝐴 → 𝐴 = ∅) |
| 8 | 5, 7 | syl 18 | . . . 4 ⊢ (𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 9 | 8 | exlimiv 1963 | . . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 10 | 4, 9 | syl 18 | . 2 ⊢ (𝐴 ≈ ∅ → 𝐴 = ∅) |
| 11 | 0ex 5260 | . . . . 5 ⊢ ∅ ∈ V | |
| 12 | f1oeq1 6800 | . . . . 5 ⊢ (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅)) | |
| 13 | f1o0 6850 | . . . . 5 ⊢ ∅:∅–1-1-onto→∅ | |
| 14 | 11, 12, 13 | ceqsexv2d 3499 | . . . 4 ⊢ ∃𝑓 𝑓:∅–1-1-onto→∅ |
| 15 | breng 8960 | . . . . 5 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)) | |
| 16 | 11, 11, 15 | mp2an 705 | . . . 4 ⊢ (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅) |
| 17 | 14, 16 | mpbir 234 | . . 3 ⊢ ∅ ≈ ∅ |
| 18 | breq1 5105 | . . 3 ⊢ (𝐴 = ∅ → (𝐴 ≈ ∅ ↔ ∅ ≈ ∅)) | |
| 19 | 17, 18 | mpbiri 261 | . 2 ⊢ (𝐴 = ∅ → 𝐴 ≈ ∅) |
| 20 | 10, 19 | impbii 212 | 1 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ↔ wb 209 ∧ wa 401 = wceq 1570 ∃wex 1812 ∈ wcel 2145 Vcvv 3450 ∅c0 4278 class class class wbr 5102 ◡ccnv 5646 –1-1-onto→wf1o 6526 ≈ cen 8948 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-ext 2732 ax-sep 5248 ax-nul 5259 ax-pr 5390 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-sb 2100 df-mo 2564 df-clab 2739 df-cleq 2752 df-clel 2835 df-ral 3077 df-rex 3087 df-rab 3413 df-v 3452 df-dif 3901 df-un 3903 df-in 3905 df-ss 3915 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-id 5542 df-xp 5653 df-rel 5654 df-cnv 5655 df-co 5656 df-dm 5657 df-rn 5658 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-en 8952 |
| This theorem is used by: 0fi 9048 enrefnn 9052 dom0 9102 sdom0 9106 findcard 9157 findcard2 9158 nneneq 9199 cantnff 9653 cantnf0 9654 cantnfp1lem2 9658 cantnflem1 9668 cantnf 9672 cnfcom2lem 9680 cardnueq0 10016 infmap2 10266 fin23lem26 10374 cardeq0 10607 hasheq0 14474 mreexexd 17783 pmtrfmvdn0 19637 pmtrsn 19694 kard0 35747 kard0b 35752 rp-isfinite6 44462 ensucne0OLD 44474 |
| Copyright terms: Public domain | W3C validator |