| 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 7751. (Revised by BTernaryTau, 23-Sep-2024.) |
| Ref | Expression |
|---|---|
| en0 | ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | encv 8981 | . . . . 5 ⊢ (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V)) | |
| 2 | breng 8982 | . . . . 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 6837 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→𝐴) | |
| 6 | f1o00 6860 | . . . . . 6 ⊢ (◡𝑓:∅–1-1-onto→𝐴 ↔ (◡𝑓 = ∅ ∧ 𝐴 = ∅)) | |
| 7 | 6 | simprbi 503 | . . . . 5 ⊢ (◡𝑓:∅–1-1-onto→𝐴 → 𝐴 = ∅) |
| 8 | 5, 7 | syl 18 | . . . 4 ⊢ (𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 9 | 8 | exlimiv 1962 | . . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 10 | 4, 9 | syl 18 | . 2 ⊢ (𝐴 ≈ ∅ → 𝐴 = ∅) |
| 11 | 0ex 5260 | . . . . 5 ⊢ ∅ ∈ V | |
| 12 | f1oeq1 6812 | . . . . 5 ⊢ (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅)) | |
| 13 | f1o0 6862 | . . . . 5 ⊢ ∅:∅–1-1-onto→∅ | |
| 14 | 11, 12, 13 | ceqsexv2d 3499 | . . . 4 ⊢ ∃𝑓 𝑓:∅–1-1-onto→∅ |
| 15 | breng 8982 | . . . . 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 1569 ∃wex 1811 ∈ wcel 2144 Vcvv 3450 ∅c0 4278 class class class wbr 5102 ◡ccnv 5649 –1-1-onto→wf1o 6537 ≈ cen 8970 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 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 1572 df-fal 1582 df-ex 1812 df-sb 2099 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-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-sn 4584 df-pr 4586 df-op 4590 df-br 5103 df-opab 5167 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-en 8974 |
| This theorem is used by: 0fi 9070 enrefnn 9074 dom0 9124 sdom0 9128 findcard 9179 findcard2 9180 nneneq 9221 cantnff 9675 cantnf0 9676 cantnfp1lem2 9680 cantnflem1 9690 cantnf 9694 cnfcom2lem 9702 cardnueq0 10045 infmap2 10295 fin23lem26 10403 cardeq0 10636 hasheq0 14507 mreexexd 17822 pmtrfmvdn0 19676 pmtrsn 19733 kard0 35864 kard0b 35869 rp-isfinite6 44562 ensucne0OLD 44574 |
| Copyright terms: Public domain | W3C validator |