MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  canthnum Structured version   Unicode version

Theorem canthnum 9063
Description: The set of well-orderable subsets of a set  A strictly dominates  A. A stronger form of canth2 7722. Corollary 1.4(a) of [KanamoriPincus] p. 417. (Contributed by Mario Carneiro, 19-May-2015.)
Assertion
Ref Expression
canthnum  |-  ( A  e.  V  ->  A  ~<  ( ~P A  i^i  dom 
card ) )

Proof of Theorem canthnum
Dummy variables  f 
a  r  s  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 pwexg 4600 . . . 4  |-  ( A  e.  V  ->  ~P A  e.  _V )
2 inex1g 4559 . . . 4  |-  ( ~P A  e.  _V  ->  ( ~P A  i^i  Fin )  e.  _V )
3 infpwfidom 8448 . . . 4  |-  ( ( ~P A  i^i  Fin )  e.  _V  ->  A  ~<_  ( ~P A  i^i  Fin ) )
41, 2, 33syl 18 . . 3  |-  ( A  e.  V  ->  A  ~<_  ( ~P A  i^i  Fin ) )
5 inex1g 4559 . . . . 5  |-  ( ~P A  e.  _V  ->  ( ~P A  i^i  dom  card )  e.  _V )
61, 5syl 17 . . . 4  |-  ( A  e.  V  ->  ( ~P A  i^i  dom  card )  e.  _V )
7 finnum 8372 . . . . . 6  |-  ( x  e.  Fin  ->  x  e.  dom  card )
87ssriv 3465 . . . . 5  |-  Fin  C_  dom  card
9 sslin 3685 . . . . 5  |-  ( Fin  C_  dom  card  ->  ( ~P A  i^i  Fin )  C_  ( ~P A  i^i  dom 
card ) )
108, 9ax-mp 5 . . . 4  |-  ( ~P A  i^i  Fin )  C_  ( ~P A  i^i  dom 
card )
11 ssdomg 7613 . . . 4  |-  ( ( ~P A  i^i  dom  card )  e.  _V  ->  ( ( ~P A  i^i  Fin )  C_  ( ~P A  i^i  dom  card )  -> 
( ~P A  i^i  Fin )  ~<_  ( ~P A  i^i  dom  card ) ) )
126, 10, 11mpisyl 22 . . 3  |-  ( A  e.  V  ->  ( ~P A  i^i  Fin )  ~<_  ( ~P A  i^i  dom  card ) )
13 domtr 7620 . . 3  |-  ( ( A  ~<_  ( ~P A  i^i  Fin )  /\  ( ~P A  i^i  Fin )  ~<_  ( ~P A  i^i  dom  card ) )  ->  A  ~<_  ( ~P A  i^i  dom  card ) )
144, 12, 13syl2anc 665 . 2  |-  ( A  e.  V  ->  A  ~<_  ( ~P A  i^i  dom  card ) )
15 eqid 2420 . . . . . . 7  |-  { <. x ,  r >.  |  ( ( x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) }  =  { <. x ,  r >.  |  ( ( x 
C_  A  /\  r  C_  ( x  X.  x
) )  /\  (
r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) }
1615fpwwecbv 9058 . . . . . 6  |-  { <. x ,  r >.  |  ( ( x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) }  =  { <. a ,  s >.  |  ( ( a 
C_  A  /\  s  C_  ( a  X.  a
) )  /\  (
s  We  a  /\  A. z  e.  a  ( f `  ( `' s " { z } ) )  =  z ) ) }
17 eqid 2420 . . . . . 6  |-  U. dom  {
<. x ,  r >.  |  ( ( x 
C_  A  /\  r  C_  ( x  X.  x
) )  /\  (
r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) }  =  U. dom  { <. x ,  r >.  |  ( ( x 
C_  A  /\  r  C_  ( x  X.  x
) )  /\  (
r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) }
18 eqid 2420 . . . . . 6  |-  ( `' ( { <. x ,  r >.  |  ( ( x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) } `  U. dom  { <. x ,  r
>.  |  ( (
x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " {
y } ) )  =  y ) ) } ) " {
( f `  U. dom  { <. x ,  r
>.  |  ( (
x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " {
y } ) )  =  y ) ) } ) } )  =  ( `' ( { <. x ,  r
>.  |  ( (
x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( f `  ( `' r " {
y } ) )  =  y ) ) } `  U. dom  {
<. x ,  r >.  |  ( ( x 
C_  A  /\  r  C_  ( x  X.  x
) )  /\  (
r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) } ) " { ( f `  U. dom  {
<. x ,  r >.  |  ( ( x 
C_  A  /\  r  C_  ( x  X.  x
) )  /\  (
r  We  x  /\  A. y  e.  x  ( f `  ( `' r " { y } ) )  =  y ) ) } ) } )
1916, 17, 18canthnumlem 9062 . . . . 5  |-  ( A  e.  V  ->  -.  f : ( ~P A  i^i  dom  card ) -1-1-> A )
20 f1of1 5821 . . . . 5  |-  ( f : ( ~P A  i^i  dom  card ) -1-1-onto-> A  ->  f :
( ~P A  i^i  dom 
card ) -1-1-> A )
2119, 20nsyl 124 . . . 4  |-  ( A  e.  V  ->  -.  f : ( ~P A  i^i  dom  card ) -1-1-onto-> A )
2221nexdv 1771 . . 3  |-  ( A  e.  V  ->  -.  E. f  f : ( ~P A  i^i  dom  card ) -1-1-onto-> A )
23 ensym 7616 . . . 4  |-  ( A 
~~  ( ~P A  i^i  dom  card )  ->  ( ~P A  i^i  dom  card )  ~~  A )
24 bren 7577 . . . 4  |-  ( ( ~P A  i^i  dom  card )  ~~  A  <->  E. f 
f : ( ~P A  i^i  dom  card )
-1-1-onto-> A )
2523, 24sylib 199 . . 3  |-  ( A 
~~  ( ~P A  i^i  dom  card )  ->  E. f 
f : ( ~P A  i^i  dom  card )
-1-1-onto-> A )
2622, 25nsyl 124 . 2  |-  ( A  e.  V  ->  -.  A  ~~  ( ~P A  i^i  dom  card ) )
27 brsdom 7590 . 2  |-  ( A 
~<  ( ~P A  i^i  dom 
card )  <->  ( A  ~<_  ( ~P A  i^i  dom  card )  /\  -.  A  ~~  ( ~P A  i^i  dom 
card ) ) )
2814, 26, 27sylanbrc 668 1  |-  ( A  e.  V  ->  A  ~<  ( ~P A  i^i  dom 
card ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 370    = wceq 1437   E.wex 1659    e. wcel 1867   A.wral 2773   _Vcvv 3078    i^i cin 3432    C_ wss 3433   ~Pcpw 3976   {csn 3993   U.cuni 4213   class class class wbr 4417   {copab 4474    We wwe 4803    X. cxp 4843   `'ccnv 4844   dom cdm 4845   "cima 4848   -1-1->wf1 5589   -1-1-onto->wf1o 5591   ` cfv 5592    ~~ cen 7565    ~<_ cdom 7566    ~< csdm 7567   Fincfn 7568   cardccrd 8359
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1665  ax-4 1678  ax-5 1748  ax-6 1794  ax-7 1838  ax-8 1869  ax-9 1871  ax-10 1886  ax-11 1891  ax-12 1904  ax-13 2052  ax-ext 2398  ax-rep 4529  ax-sep 4539  ax-nul 4547  ax-pow 4594  ax-pr 4652  ax-un 6588
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-ex 1660  df-nf 1664  df-sb 1787  df-eu 2267  df-mo 2268  df-clab 2406  df-cleq 2412  df-clel 2415  df-nfc 2570  df-ne 2618  df-ral 2778  df-rex 2779  df-reu 2780  df-rmo 2781  df-rab 2782  df-v 3080  df-sbc 3297  df-csb 3393  df-dif 3436  df-un 3438  df-in 3440  df-ss 3447  df-pss 3449  df-nul 3759  df-if 3907  df-pw 3978  df-sn 3994  df-pr 3996  df-tp 3998  df-op 4000  df-uni 4214  df-int 4250  df-iun 4295  df-br 4418  df-opab 4476  df-mpt 4477  df-tr 4512  df-eprel 4756  df-id 4760  df-po 4766  df-so 4767  df-fr 4804  df-se 4805  df-we 4806  df-xp 4851  df-rel 4852  df-cnv 4853  df-co 4854  df-dm 4855  df-rn 4856  df-res 4857  df-ima 4858  df-pred 5390  df-ord 5436  df-on 5437  df-lim 5438  df-suc 5439  df-iota 5556  df-fun 5594  df-fn 5595  df-f 5596  df-f1 5597  df-fo 5598  df-f1o 5599  df-fv 5600  df-isom 5601  df-riota 6258  df-ov 6299  df-om 6698  df-1st 6798  df-wrecs 7027  df-recs 7089  df-1o 7181  df-er 7362  df-en 7569  df-dom 7570  df-sdom 7571  df-fin 7572  df-oi 8016  df-card 8363
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator