HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem canth2g 4471
Description: Cantor's theorem with the sethood requirement expressed as an antecedent. Theorem 23 of [Suppes] p. 97.
Assertion
Ref Expression
canth2g |- (A e. B -> A ~< P~A)

Proof of Theorem canth2g
StepHypRef Expression
1 pweq 2399 . . 3 |- (x = A -> P~x = P~A)
2 breq12 2619 . . 3 |- ((x = A /\ P~x = P~A) -> (x ~< P~x <-> A ~< P~A))
31, 2mpdan 703 . 2 |- (x = A -> (x ~< P~x <-> A ~< P~A))
4 visset 1809 . . 3 |- x e. V
54canth2 4470 . 2 |- x ~< P~x
63, 5vtoclg 1843 1 |- (A e. B -> A ~< P~A)
Colors of variables: wff set class
Syntax hints:   -> wi 3   <-> wb 146   = wceq 954   e. wcel 956  P~cpw 2397   class class class wbr 2614   ~< csdm 4356
This theorem is referenced by:  pwuninel 4472  2pwuninel 4473  pwfi 4551  canth3 4830  ondomon 4836
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 960  ax-gen 961  ax-8 962  ax-9 963  ax-10 964  ax-11 965  ax-12 966  ax-13 967  ax-14 968  ax-17 969  ax-4 971  ax-5o 973  ax-6o 976  ax-9o 1121  ax-10o 1138  ax-16 1208  ax-11o 1216  ax-ext 1457  ax-rep 2688  ax-sep 2698  ax-pow 2737  ax-pr 2774  ax-un 2861
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 979  df-sb 1170  df-eu 1380  df-mo 1381  df-clab 1462  df-cleq 1467  df-clel 1470  df-ne 1584  df-ral 1646  df-rex 1647  df-rab 1649  df-v 1808  df-dif 2045  df-un 2046  df-in 2047  df-ss 2049  df-nul 2277  df-pw 2398  df-sn 2408  df-pr 2409  df-op 2412  df-uni 2499  df-br 2615  df-opab 2662  df-id 2830  df-xp 3179  df-rel 3180  df-cnv 3181  df-co 3182  df-dm 3183  df-rn 3184  df-res 3185  df-ima 3186  df-fun 3187  df-fn 3188  df-f 3189  df-f1 3190  df-fo 3191  df-f1o 3192  df-fv 3193  df-en 4357  df-dom 4358  df-sdom 4359
Copyright terms: Public domain