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

Theorem en0 8940
Description: The empty set is equinumerous only to itself. Exercise 1 of [TakeutiZaring] p. 88. (Contributed by NM, 27-May-1998.) Avoid ax-pow 5301, ax-un 7668. (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 8877 . . . . 5 (𝐴 ≈ ∅ → (𝐴 ∈ V ∧ ∅ ∈ V))
2 breng 8878 . . . . 5 ((𝐴 ∈ V ∧ ∅ ∈ V) → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
31, 2syl 17 . . . 4 (𝐴 ≈ ∅ → (𝐴 ≈ ∅ ↔ ∃𝑓 𝑓:𝐴1-1-onto→∅))
43ibi 267 . . 3 (𝐴 ≈ ∅ → ∃𝑓 𝑓:𝐴1-1-onto→∅)
5 f1ocnv 6775 . . . . 5 (𝑓:𝐴1-1-onto→∅ → 𝑓:∅–1-1-onto𝐴)
6 f1o00 6798 . . . . . 6 (𝑓:∅–1-1-onto𝐴 ↔ (𝑓 = ∅ ∧ 𝐴 = ∅))
76simprbi 496 . . . . 5 (𝑓:∅–1-1-onto𝐴𝐴 = ∅)
85, 7syl 17 . . . 4 (𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
98exlimiv 1931 . . 3 (∃𝑓 𝑓:𝐴1-1-onto→∅ → 𝐴 = ∅)
104, 9syl 17 . 2 (𝐴 ≈ ∅ → 𝐴 = ∅)
11 0ex 5243 . . . . 5 ∅ ∈ V
12 f1oeq1 6751 . . . . 5 (𝑓 = ∅ → (𝑓:∅–1-1-onto→∅ ↔ ∅:∅–1-1-onto→∅))
13 f1o0 6800 . . . . 5 ∅:∅–1-1-onto→∅
1411, 12, 13ceqsexv2d 3487 . . . 4 𝑓 𝑓:∅–1-1-onto→∅
15 breng 8878 . . . . 5 ((∅ ∈ V ∧ ∅ ∈ V) → (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅))
1611, 11, 15mp2an 692 . . . 4 (∅ ≈ ∅ ↔ ∃𝑓 𝑓:∅–1-1-onto→∅)
1714, 16mpbir 231 . . 3 ∅ ≈ ∅
18 breq1 5092 . . 3 (𝐴 = ∅ → (𝐴 ≈ ∅ ↔ ∅ ≈ ∅))
1917, 18mpbiri 258 . 2 (𝐴 = ∅ → 𝐴 ≈ ∅)
2010, 19impbii 209 1 (𝐴 ≈ ∅ ↔ 𝐴 = ∅)
Colors of variables: wff setvar class
Syntax hints:  wb 206  wa 395   = wceq 1541  wex 1780  wcel 2111  Vcvv 3436  c0 4280   class class class wbr 5089  ccnv 5613  1-1-ontowf1o 6480  cen 8866
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2113  ax-9 2121  ax-ext 2703  ax-sep 5232  ax-nul 5242  ax-pr 5368
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-sb 2068  df-mo 2535  df-clab 2710  df-cleq 2723  df-clel 2806  df-ral 3048  df-rex 3057  df-rab 3396  df-v 3438  df-dif 3900  df-un 3902  df-ss 3914  df-nul 4281  df-if 4473  df-sn 4574  df-pr 4576  df-op 4580  df-br 5090  df-opab 5152  df-id 5509  df-xp 5620  df-rel 5621  df-cnv 5622  df-co 5623  df-dm 5624  df-rn 5625  df-fun 6483  df-fn 6484  df-f 6485  df-f1 6486  df-fo 6487  df-f1o 6488  df-en 8870
This theorem is referenced by:  0fi  8964  enrefnn  8968  dom0  9018  sdom0  9022  findcard  9073  findcard2  9074  nneneq  9115  cantnff  9564  cantnf0  9565  cantnfp1lem2  9569  cantnflem1  9579  cantnf  9583  cnfcom2lem  9591  cardnueq0  9857  infmap2  10108  fin23lem26  10216  cardeq0  10443  hasheq0  14270  mreexexd  17554  pmtrfmvdn0  19374  pmtrsn  19431  rp-isfinite6  43610  ensucne0OLD  43622
  Copyright terms: Public domain W3C validator