MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  en0 Structured version   Visualization version   GIF version

Theorem en0 8989
Description: The empty set is equinumerous only to itself. Exercise 1 of [TakeutiZaring] p. 88. (Contributed by NM, 27-May-1998.) Avoid ax-pow 5320, ax-un 7711. (Revised by BTernaryTau, 23-Sep-2024.)
Assertion
Ref Expression
en0 (𝐴 ≈ ∅ ↔ 𝐴 = ∅)

Proof of Theorem en0
Dummy variable 𝑓 is distinct from all other variables.
StepHypRef Expression
1 encv 8926 . . . . 5 (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V))
2 breng 8927 . . . . 5 ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
31, 2syl 17 . . . 4 (𝐴 ≈ ∅ → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
43ibi 267 . . 3 (𝐴 ≈ ∅ → ∃𝑓 𝑓:𝐴1-1-onto→∅)
5 f1ocnv 6812 . . . . 5 (𝑓:𝐴1-1-onto→∅ → 𝑓:∅–1-1-onto𝐴)
6 f1o00 6835 . . . . . 6 (𝑓:∅–1-1-onto𝐴 ↔ (𝑓 = ∅ ∧ 𝐴 = ∅))
76simprbi 496 . . . . 5 (𝑓:∅–1-1-onto𝐴𝐴 = ∅)
85, 7syl 17 . . . 4 (𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
98exlimiv 1930 . . 3 (∃𝑓 𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
104, 9syl 17 . 2 (𝐴 ≈ ∅ → 𝐴 = ∅)
11 0ex 5262 . . . . 5 ∅ ∈ V
12 f1oeq1 6788 . . . . 5 (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅))
13 f1o0 6837 . . . . 5 ∅:∅–1-1-onto→∅
1411, 12, 13ceqsexv2d 3499 . . . 4 𝑓 𝑓:∅–1-1-onto→∅
15 breng 8927 . . . . 5 ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅))
1611, 11, 15mp2an 692 . . . 4 (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)
1714, 16mpbir 231 . . 3 ∅ ≈ ∅
18 breq1 5110 . . 3 (𝐴 = ∅ → (𝐴 ≈ ∅ ↔ ∅ ≈ ∅))
1917, 18mpbiri 258 . 2 (𝐴 = ∅ → 𝐴 ≈ ∅)
2010, 19impbii 209 1 (𝐴 ≈ ∅ ↔ 𝐴 = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1540  wex 1779  wcel 2109  Vcvv 3447  c0 4296   class class class wbr 5107  ccnv 5637  1-1-ontowf1o 6510  cen 8915
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-12 2178  ax-ext 2701  ax-sep 5251  ax-nul 5261  ax-pr 5387
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-sb 2066  df-mo 2533  df-clab 2708  df-cleq 2721  df-clel 2803  df-ral 3045  df-rex 3054  df-rab 3406  df-v 3449  df-dif 3917  df-un 3919  df-ss 3931  df-nul 4297  df-if 4489  df-sn 4590  df-pr 4592  df-op 4596  df-br 5108  df-opab 5170  df-id 5533  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-en 8919
This theorem is referenced by:  0fi  9013  snfiOLD  9015  enrefnn  9018  dom0  9069  sdom0  9073  findcard  9127  findcard2  9128  nneneq  9170  enp1iOLD  9225  fiintOLD  9278  cantnff  9627  cantnf0  9628  cantnfp1lem2  9632  cantnflem1  9642  cantnf  9646  cnfcom2lem  9654  cardnueq0  9917  infmap2  10170  fin23lem26  10278  cardeq0  10505  hasheq0  14328  mreexexd  17609  pmtrfmvdn0  19392  pmtrsn  19449  rp-isfinite6  43507  ensucne0OLD  43519
  Copyright terms: Public domain W3C validator