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

Theorem canthwdom 9577
Description: Cantor's Theorem, stated using weak dominance (this is actually a stronger statement than canth2 9153, equivalent to canth 7375). (Contributed by Mario Carneiro, 15-May-2015.)
Assertion
Ref Expression
canthwdom ¬ 𝒫 𝐴 ≼* 𝐴

Proof of Theorem canthwdom
Dummy variables 𝑥 𝑓 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 0elpw 5316 . . . . 5 ∅ ∈ 𝒫 𝐴
2 ne0i 4286 . . . . 5 (∅ ∈ 𝒫 𝐴 → 𝒫 𝐴 ≠ ∅)
31, 2mp1i 14 . . . 4 (𝒫 𝐴 ≼* 𝐴 → 𝒫 𝐴 ≠ ∅)
4 brwdomn0 9567 . . . 4 (𝒫 𝐴 ≠ ∅ → (𝒫 𝐴 ≼* 𝐴 ↔ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴))
53, 4syl 18 . . 3 (𝒫 𝐴 ≼* 𝐴 → (𝒫 𝐴 ≼* 𝐴 ↔ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴))
65ibi 270 . 2 (𝒫 𝐴 ≼* 𝐴 → ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴)
7 relwdom 9564 . . . . 5 Rel ≼*
87brrelex2i 5707 . . . 4 (𝒫 𝐴 ≼* 𝐴 → 𝐴 ∈ V)
9 foeq2 6794 . . . . . . 7 (𝑥 = 𝐴 → (𝑓:𝑥–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝑥))
10 pweq 4570 . . . . . . . 8 (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴)
11 foeq3 6795 . . . . . . . 8 (𝒫 𝑥 = 𝒫 𝐴 → (𝑓:𝐴–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
1210, 11syl 18 . . . . . . 7 (𝑥 = 𝐴 → (𝑓:𝐴–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
139, 12bitrd 282 . . . . . 6 (𝑥 = 𝐴 → (𝑓:𝑥–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
1413notbid 321 . . . . 5 (𝑥 = 𝐴 → (¬ 𝑓:𝑥–onto→𝒫 𝑥 ↔ ¬ 𝑓:𝐴–onto→𝒫 𝐴))
15 vex 3454 . . . . . 6 𝑥 ∈ V
1615canth 7375 . . . . 5 ¬ 𝑓:𝑥–onto→𝒫 𝑥
1714, 16vtoclg 3517 . . . 4 (𝐴 ∈ V → ¬ 𝑓:𝐴–onto→𝒫 𝐴)
188, 17syl 18 . . 3 (𝒫 𝐴 ≼* 𝐴 → ¬ 𝑓:𝐴–onto→𝒫 𝐴)
1918nexdv 1968 . 2 (𝒫 𝐴 ≼* 𝐴 → ¬ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴)
206, 19pm2.65i 196 1 ¬ 𝒫 𝐴 ≼* 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1569  ∃wex 1811   ∈ wcel 2144   ≠ wne 2955  Vcvv 3450  ∅c0 4278  𝒫 cpw 4556   class class class wbr 5102  –onto→wfo 6537   ≼* cwdom 9562
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-sep 5248  ax-nul 5259  ax-pr 5390  ax-un 7752
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rab 3413  df-v 3452  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-fo 6545  df-fv 6547  df-wdom 9563
This theorem is used by:  pwdjudom  10297
  Copyright terms: Public domain W3C validator