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

Theorem canthnum 9092
Description: The set of well-orderable subsets of a set  A strictly dominates  A. A stronger form of canth2 7743. 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 4585 . . . 4  |-  ( A  e.  V  ->  ~P A  e.  _V )
2 inex1g 4539 . . . 4  |-  ( ~P A  e.  _V  ->  ( ~P A  i^i  Fin )  e.  _V )
3 infpwfidom 8477 . . . 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 4539 . . . . 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 8400 . . . . . 6  |-  ( x  e.  Fin  ->  x  e.  dom  card )
87ssriv 3422 . . . . 5  |-  Fin  C_  dom  card
9 sslin 3649 . . . . 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 7633 . . . 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 21 . . 3  |-  ( A  e.  V  ->  ( ~P A  i^i  Fin )  ~<_  ( ~P A  i^i  dom  card ) )
13 domtr 7640 . . 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 673 . 2  |-  ( A  e.  V  ->  A  ~<_  ( ~P A  i^i  dom  card ) )
15 eqid 2471 . . . . . . 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 9087 . . . . . 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 2471 . . . . . 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 2471 . . . . . 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 9091 . . . . 5  |-  ( A  e.  V  ->  -.  f : ( ~P A  i^i  dom  card ) -1-1-> A )
20 f1of1 5827 . . . . 5  |-  ( f : ( ~P A  i^i  dom  card ) -1-1-onto-> A  ->  f :
( ~P A  i^i  dom 
card ) -1-1-> A )
2119, 20nsyl 125 . . . 4  |-  ( A  e.  V  ->  -.  f : ( ~P A  i^i  dom  card ) -1-1-onto-> A )
2221nexdv 1790 . . 3  |-  ( A  e.  V  ->  -.  E. f  f : ( ~P A  i^i  dom  card ) -1-1-onto-> A )
23 ensym 7636 . . . 4  |-  ( A 
~~  ( ~P A  i^i  dom  card )  ->  ( ~P A  i^i  dom  card )  ~~  A )
24 bren 7596 . . . 4  |-  ( ( ~P A  i^i  dom  card )  ~~  A  <->  E. f 
f : ( ~P A  i^i  dom  card )
-1-1-onto-> A )
2523, 24sylib 201 . . 3  |-  ( A 
~~  ( ~P A  i^i  dom  card )  ->  E. f 
f : ( ~P A  i^i  dom  card )
-1-1-onto-> A )
2622, 25nsyl 125 . 2  |-  ( A  e.  V  ->  -.  A  ~~  ( ~P A  i^i  dom  card ) )
27 brsdom 7610 . 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 677 1  |-  ( A  e.  V  ->  A  ~<  ( ~P A  i^i  dom 
card ) )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 376    = wceq 1452   E.wex 1671    e. wcel 1904   A.wral 2756   _Vcvv 3031    i^i cin 3389    C_ wss 3390   ~Pcpw 3942   {csn 3959   U.cuni 4190   class class class wbr 4395   {copab 4453    We wwe 4797    X. cxp 4837   `'ccnv 4838   dom cdm 4839   "cima 4842   -1-1->wf1 5586   -1-1-onto->wf1o 5588   ` cfv 5589    ~~ cen 7584    ~<_ cdom 7585    ~< csdm 7586   Fincfn 7587   cardccrd 8387
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1677  ax-4 1690  ax-5 1766  ax-6 1813  ax-7 1859  ax-8 1906  ax-9 1913  ax-10 1932  ax-11 1937  ax-12 1950  ax-13 2104  ax-ext 2451  ax-rep 4508  ax-sep 4518  ax-nul 4527  ax-pow 4579  ax-pr 4639  ax-un 6602
This theorem depends on definitions:  df-bi 190  df-or 377  df-an 378  df-3or 1008  df-3an 1009  df-tru 1455  df-ex 1672  df-nf 1676  df-sb 1806  df-eu 2323  df-mo 2324  df-clab 2458  df-cleq 2464  df-clel 2467  df-nfc 2601  df-ne 2643  df-ral 2761  df-rex 2762  df-reu 2763  df-rmo 2764  df-rab 2765  df-v 3033  df-sbc 3256  df-csb 3350  df-dif 3393  df-un 3395  df-in 3397  df-ss 3404  df-pss 3406  df-nul 3723  df-if 3873  df-pw 3944  df-sn 3960  df-pr 3962  df-tp 3964  df-op 3966  df-uni 4191  df-int 4227  df-iun 4271  df-br 4396  df-opab 4455  df-mpt 4456  df-tr 4491  df-eprel 4750  df-id 4754  df-po 4760  df-so 4761  df-fr 4798  df-se 4799  df-we 4800  df-xp 4845  df-rel 4846  df-cnv 4847  df-co 4848  df-dm 4849  df-rn 4850  df-res 4851  df-ima 4852  df-pred 5387  df-ord 5433  df-on 5434  df-lim 5435  df-suc 5436  df-iota 5553  df-fun 5591  df-fn 5592  df-f 5593  df-f1 5594  df-fo 5595  df-f1o 5596  df-fv 5597  df-isom 5598  df-riota 6270  df-ov 6311  df-om 6712  df-1st 6812  df-wrecs 7046  df-recs 7108  df-1o 7200  df-er 7381  df-en 7588  df-dom 7589  df-sdom 7590  df-fin 7591  df-oi 8043  df-card 8391
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator