![]() |
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 5325, ax-un 7677. (Revised by BTernaryTau, 23-Sep-2024.) |
Ref | Expression |
---|---|
en0 | ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | encv 8898 | . . . . 5 ⊢ (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V)) | |
2 | breng 8899 | . . . . 5 ⊢ ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴–1-1-onto→∅)) | |
3 | 1, 2 | syl 17 | . . . 4 ⊢ (𝐴 ≈ ∅ → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴–1-1-onto→∅)) |
4 | 3 | ibi 266 | . . 3 ⊢ (𝐴 ≈ ∅ → ∃𝑓 𝑓:𝐴–1-1-onto→∅) |
5 | f1ocnv 6801 | . . . . 5 ⊢ (𝑓:𝐴–1-1-onto→∅ → ◡𝑓:∅–1-1-onto→𝐴) | |
6 | f1o00 6824 | . . . . . 6 ⊢ (◡𝑓:∅–1-1-onto→𝐴 ↔ (◡𝑓 = ∅ ∧ 𝐴 = ∅)) | |
7 | 6 | simprbi 497 | . . . . 5 ⊢ (◡𝑓:∅–1-1-onto→𝐴 → 𝐴 = ∅) |
8 | 5, 7 | syl 17 | . . . 4 ⊢ (𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
9 | 8 | exlimiv 1933 | . . 3 ⊢ (∃𝑓 𝑓:𝐴–1-1-onto→∅ → 𝐴 = ∅) |
10 | 4, 9 | syl 17 | . 2 ⊢ (𝐴 ≈ ∅ → 𝐴 = ∅) |
11 | 0ex 5269 | . . . . 5 ⊢ ∅ ∈ V | |
12 | f1oeq1 6777 | . . . . 5 ⊢ (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅)) | |
13 | f1o0 6826 | . . . . 5 ⊢ ∅:∅–1-1-onto→∅ | |
14 | 11, 12, 13 | ceqsexv2d 3498 | . . . 4 ⊢ ∃𝑓 𝑓:∅–1-1-onto→∅ |
15 | breng 8899 | . . . . 5 ⊢ ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)) | |
16 | 11, 11, 15 | mp2an 690 | . . . 4 ⊢ (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅) |
17 | 14, 16 | mpbir 230 | . . 3 ⊢ ∅ ≈ ∅ |
18 | breq1 5113 | . . 3 ⊢ (𝐴 = ∅ → (𝐴 ≈ ∅ ↔ ∅ ≈ ∅)) | |
19 | 17, 18 | mpbiri 257 | . 2 ⊢ (𝐴 = ∅ → 𝐴 ≈ ∅) |
20 | 10, 19 | impbii 208 | 1 ⊢ (𝐴 ≈ ∅ ↔ 𝐴 = ∅) |
Colors of variables: wff setvar class |
Syntax hints: ↔ wb 205 ∧ wa 396 = wceq 1541 ∃wex 1781 ∈ wcel 2106 Vcvv 3446 ∅c0 4287 class class class wbr 5110 ◡ccnv 5637 –1-1-onto→wf1o 6500 ≈ cen 8887 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-12 2171 ax-ext 2702 ax-sep 5261 ax-nul 5268 ax-pr 5389 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 846 df-3an 1089 df-tru 1544 df-fal 1554 df-ex 1782 df-sb 2068 df-mo 2533 df-clab 2709 df-cleq 2723 df-clel 2809 df-ral 3061 df-rex 3070 df-rab 3406 df-v 3448 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4288 df-if 4492 df-sn 4592 df-pr 4594 df-op 4598 df-br 5111 df-opab 5173 df-id 5536 df-xp 5644 df-rel 5645 df-cnv 5646 df-co 5647 df-dm 5648 df-rn 5649 df-fun 6503 df-fn 6504 df-f 6505 df-f1 6506 df-fo 6507 df-f1o 6508 df-en 8891 |
This theorem is referenced by: snfi 8995 enrefnn 8998 dom0 9053 dom0OLD 9054 0sdomgOLD 9056 sdom0 9059 findcard 9114 findcard2 9115 nneneq 9160 nneneqOLD 9172 snnen2oOLD 9178 enp1iOLD 9231 findcard2OLD 9235 fiint 9275 cantnff 9619 cantnf0 9620 cantnfp1lem2 9624 cantnflem1 9634 cantnf 9638 cnfcom2lem 9646 cardnueq0 9909 infmap2 10163 fin23lem26 10270 cardeq0 10497 hasheq0 14273 mreexexd 17542 pmtrfmvdn0 19258 pmtrsn 19315 rp-isfinite6 41912 ensucne0OLD 41924 |
Copyright terms: Public domain | W3C validator |