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

Theorem canthwdom 9566
Description: Cantor's Theorem, stated using weak dominance (this is actually a stronger statement than canth2 9142, equivalent to canth 7372). (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 5317 . . . . 5 ∅ ∈ 𝒫 𝐴
2 ne0i 4287 . . . . 5 (∅ ∈ 𝒫 𝐴 → 𝒫 𝐴 ≠ ∅)
31, 2mp1i 14 . . . 4 (𝒫 𝐴 ≼* 𝐴 → 𝒫 𝐴 ≠ ∅)
4 brwdomn0 9556 . . . 4 (𝒫 𝐴 ≠ ∅ → (𝒫 𝐴 ≼* 𝐴 ↔ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴))
53, 4syl 18 . . 3 (𝒫 𝐴 ≼* 𝐴 → (𝒫 𝐴 ≼* 𝐴 ↔ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴))
65ibi 270 . 2 (𝒫 𝐴 ≼* 𝐴 → ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴)
7 relwdom 9553 . . . . 5 Rel ≼*
87brrelex2i 5708 . . . 4 (𝒫 𝐴 ≼* 𝐴 → 𝐴 ∈ V)
9 foeq2 6791 . . . . . . 7 (𝑥 = 𝐴 → (𝑓:𝑥–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝑥))
10 pweq 4571 . . . . . . . 8 (𝑥 = 𝐴 → 𝒫 𝑥 = 𝒫 𝐴)
11 foeq3 6792 . . . . . . . 8 (𝒫 𝑥 = 𝒫 𝐴 → (𝑓:𝐴–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
1210, 11syl 18 . . . . . . 7 (𝑥 = 𝐴 → (𝑓:𝐴–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
139, 12bitrd 282 . . . . . 6 (𝑥 = 𝐴 → (𝑓:𝑥–onto→𝒫 𝑥 ↔ 𝑓:𝐴–onto→𝒫 𝐴))
1413notbid 321 . . . . 5 (𝑥 = 𝐴 → (¬ 𝑓:𝑥–onto→𝒫 𝑥 ↔ ¬ 𝑓:𝐴–onto→𝒫 𝐴))
15 vex 3455 . . . . . 6 𝑥 ∈ V
1615canth 7372 . . . . 5 ¬ 𝑓:𝑥–onto→𝒫 𝑥
1714, 16vtoclg 3518 . . . 4 (𝐴 ∈ V → ¬ 𝑓:𝐴–onto→𝒫 𝐴)
188, 17syl 18 . . 3 (𝒫 𝐴 ≼* 𝐴 → ¬ 𝑓:𝐴–onto→𝒫 𝐴)
1918nexdv 1969 . 2 (𝒫 𝐴 ≼* 𝐴 → ¬ ∃𝑓 𝑓:𝐴–onto→𝒫 𝐴)
206, 19pm2.65i 196 1 ¬ 𝒫 𝐴 ≼* 𝐴
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   = wceq 1570  ∃wex 1812   ∈ wcel 2145   ≠ wne 2956  Vcvv 3451  ∅c0 4279  𝒫 cpw 4557   class class class wbr 5103  –onto→wfo 6535   ≼* cwdom 9551
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pr 5391  ax-un 7749
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fo 6543  df-fv 6545  df-wdom 9552
This theorem is used by:  pwdjudom  10286
  Copyright terms: Public domain W3C validator