| 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 5334, ax-un 7739. (Revised by BTernaryTau, 23-Sep-2024.) |
| Ref | Expression |
|---|---|
| en0 | ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | encv 8963 | . . . . 5 ⊢ (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V)) | |
| 2 | breng 8964 | . . . . 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 6834 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→𝐴) | |
| 6 | f1o00 6857 | . . . . . 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 5268 | . . . . 5 ⊢ ∅ ∈ V | |
| 12 | f1oeq1 6809 | . . . . 5 ⊢ (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅)) | |
| 13 | f1o0 6859 | . . . . 5 ⊢ ∅:∅–1-1-onto→∅ | |
| 14 | 11, 12, 13 | ceqsexv2d 3502 | . . . 4 ⊢ ∃𝑓 𝑓:∅–1-1-onto→∅ |
| 15 | breng 8964 | . . . . 5 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)) | |
| 16 | 11, 11, 15 | mp2an 705 | . . . 4 ⊢ (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅) |
| 17 | 14, 16 | mpbir 234 | . . 3 ⊢ ∅ ≈ ∅ |
| 18 | breq1 5110 | . . 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 3453 ∅c0 4282 class class class wbr 5107 ◡ccnv 5658 –1-1-onto→wf1o 6536 ≈ cen 8952 |
| 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 2734 ax-sep 5255 ax-nul 5267 ax-pr 5402 |
| 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 2566 df-clab 2741 df-cleq 2754 df-clel 2837 df-ral 3079 df-rex 3089 df-rab 3415 df-v 3455 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-nul 4283 df-if 4486 df-sn 4588 df-pr 4590 df-op 4594 df-br 5108 df-opab 5172 df-id 5554 df-xp 5665 df-rel 5666 df-cnv 5667 df-co 5668 df-dm 5669 df-rn 5670 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-en 8956 |
| This theorem is used by: 0fi 9052 enrefnn 9056 dom0 9106 sdom0 9110 findcard 9161 findcard2 9162 nneneq 9203 cantnff 9656 cantnf0 9657 cantnfp1lem2 9661 cantnflem1 9671 cantnf 9675 cnfcom2lem 9683 cardnueq0 9972 infmap2 10222 fin23lem26 10330 cardeq0 10563 hasheq0 14429 mreexexd 17740 pmtrfmvdn0 19590 pmtrsn 19647 kard0 35667 kard0b 35672 rp-isfinite6 44345 ensucne0OLD 44357 |
| Copyright terms: Public domain | W3C validator |