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

Theorem en0 8956
Description: The empty set is equinumerous only to itself. Exercise 1 of [TakeutiZaring] p. 88. (Contributed by NM, 27-May-1998.) Avoid ax-pow 5300, ax-un 7680. (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 8892 . . . . 5 (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V))
2 breng 8893 . . . . 5 ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
31, 2syl 17 . . . 4 (𝐴 ≈ ∅ → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
43ibi 267 . . 3 (𝐴 ≈ ∅ → ∃𝑓 𝑓:𝐴1-1-onto→∅)
5 f1ocnv 6784 . . . . 5 (𝑓:𝐴1-1-onto→∅ → 𝑓:∅–1-1-onto𝐴)
6 f1o00 6807 . . . . . 6 (𝑓:∅–1-1-onto𝐴 ↔ (𝑓 = ∅ ∧ 𝐴 = ∅))
76simprbi 497 . . . . 5 (𝑓:∅–1-1-onto𝐴𝐴 = ∅)
85, 7syl 17 . . . 4 (𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
98exlimiv 1932 . . 3 (∃𝑓 𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
104, 9syl 17 . 2 (𝐴 ≈ ∅ → 𝐴 = ∅)
11 0ex 5242 . . . . 5 ∅ ∈ V
12 f1oeq1 6760 . . . . 5 (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅))
13 f1o0 6809 . . . . 5 ∅:∅–1-1-onto→∅
1411, 12, 13ceqsexv2d 3480 . . . 4 𝑓 𝑓:∅–1-1-onto→∅
15 breng 8893 . . . . 5 ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅))
1611, 11, 15mp2an 693 . . . 4 (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)
1714, 16mpbir 231 . . 3 ∅ ≈ ∅
18 breq1 5089 . . 3 (𝐴 = ∅ → (𝐴 ≈ ∅ ↔ ∅ ≈ ∅))
1917, 18mpbiri 258 . 2 (𝐴 = ∅ → 𝐴 ≈ ∅)
2010, 19impbii 209 1 (𝐴 ≈ ∅ ↔ 𝐴 = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1542  wex 1781  wcel 2114  Vcvv 3430  c0 4274   class class class wbr 5086  ccnv 5621  1-1-ontowf1o 6489  cen 8881
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 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-ext 2709  ax-sep 5231  ax-nul 5241  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-sb 2069  df-mo 2540  df-clab 2716  df-cleq 2729  df-clel 2812  df-ral 3053  df-rex 3063  df-rab 3391  df-v 3432  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4275  df-if 4468  df-sn 4569  df-pr 4571  df-op 4575  df-br 5087  df-opab 5149  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-fun 6492  df-fn 6493  df-f 6494  df-f1 6495  df-fo 6496  df-f1o 6497  df-en 8885
This theorem is referenced by:  0fi  8980  enrefnn  8984  dom0  9034  sdom0  9038  findcard  9089  findcard2  9090  nneneq  9131  cantnff  9584  cantnf0  9585  cantnfp1lem2  9589  cantnflem1  9599  cantnf  9603  cnfcom2lem  9611  cardnueq0  9877  infmap2  10128  fin23lem26  10236  cardeq0  10463  hasheq0  14287  mreexexd  17572  pmtrfmvdn0  19395  pmtrsn  19452  rp-isfinite6  43948  ensucne0OLD  43960
  Copyright terms: Public domain W3C validator