| 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 5335, ax-un 7734. (Revised by BTernaryTau, 23-Sep-2024.) |
| Ref | Expression |
|---|---|
| en0 | ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | encv 8949 | . . . . 5 ⊢ (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V)) | |
| 2 | breng 8950 | . . . . 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 6833 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→𝐴) | |
| 6 | f1o00 6856 | . . . . . 6 ⊢ (◡𝑓:∅–1-1-onto→𝐴 ↔ (◡𝑓 = ∅ ∧ 𝐴 = ∅)) | |
| 7 | 6 | simprbi 502 | . . . . 5 ⊢ (◡𝑓:∅–1-1-onto→𝐴 → 𝐴 = ∅) |
| 8 | 5, 7 | syl 18 | . . . 4 ⊢ (𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 9 | 8 | exlimiv 1959 | . . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
| 10 | 4, 9 | syl 18 | . 2 ⊢ (𝐴 ≈ ∅ → 𝐴 = ∅) |
| 11 | 0ex 5269 | . . . . 5 ⊢ ∅ ∈ V | |
| 12 | f1oeq1 6808 | . . . . 5 ⊢ (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅)) | |
| 13 | f1o0 6858 | . . . . 5 ⊢ ∅:∅–1-1-onto→∅ | |
| 14 | 11, 12, 13 | ceqsexv2d 3503 | . . . 4 ⊢ ∃𝑓 𝑓:∅–1-1-onto→∅ |
| 15 | breng 8950 | . . . . 5 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)) | |
| 16 | 11, 11, 15 | mp2an 704 | . . . 4 ⊢ (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅) |
| 17 | 14, 16 | mpbir 234 | . . 3 ⊢ ∅ ≈ ∅ |
| 18 | breq1 5111 | . . 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 400 = wceq 1569 ∃wex 1808 ∈ wcel 2142 Vcvv 3454 ∅c0 4285 class class class wbr 5108 ◡ccnv 5659 –1-1-onto→wf1o 6535 ≈ cen 8938 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-ext 2734 ax-sep 5256 ax-nul 5268 ax-pr 5403 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-sb 2096 df-mo 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3416 df-v 3456 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-sn 4589 df-pr 4591 df-op 4595 df-br 5109 df-opab 5173 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-en 8942 |
| This theorem is used by: 0fi 9037 enrefnn 9041 dom0 9091 sdom0 9095 findcard 9146 findcard2 9147 nneneq 9188 cantnff 9641 cantnf0 9642 cantnfp1lem2 9646 cantnflem1 9656 cantnf 9660 cnfcom2lem 9668 cardnueq0 9957 infmap2 10207 fin23lem26 10315 cardeq0 10542 hasheq0 14406 mreexexd 17710 pmtrfmvdn0 19538 pmtrsn 19595 kard0 35575 kard0b 35580 rp-isfinite6 44272 ensucne0OLD 44284 |
| Copyright terms: Public domain | W3C validator |