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

Theorem canthp1 9030
Description: A slightly stronger form of Cantor's theorem: For  1  <  n,  n  +  1  <  2 ^ n. Corollary 1.6 of [KanamoriPincus] p. 417. (Contributed by Mario Carneiro, 18-May-2015.)
Assertion
Ref Expression
canthp1  |-  ( 1o 
~<  A  ->  ( A  +c  1o )  ~<  ~P A )

Proof of Theorem canthp1
Dummy variables  f 
a  g  r  s  w  x  y  z are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 1sdom2 7724 . . . 4  |-  1o  ~<  2o
2 sdomdom 7551 . . . 4  |-  ( 1o 
~<  2o  ->  1o  ~<_  2o )
3 cdadom2 8568 . . . 4  |-  ( 1o  ~<_  2o  ->  ( A  +c  1o )  ~<_  ( A  +c  2o ) )
41, 2, 3mp2b 10 . . 3  |-  ( A  +c  1o )  ~<_  ( A  +c  2o )
5 canthp1lem1 9028 . . 3  |-  ( 1o 
~<  A  ->  ( A  +c  2o )  ~<_  ~P A )
6 domtr 7576 . . 3  |-  ( ( ( A  +c  1o )  ~<_  ( A  +c  2o )  /\  ( A  +c  2o )  ~<_  ~P A )  ->  ( A  +c  1o )  ~<_  ~P A )
74, 5, 6sylancr 667 . 2  |-  ( 1o 
~<  A  ->  ( A  +c  1o )  ~<_  ~P A )
8 fal 1444 . . 3  |-  -. F.
9 ensym 7572 . . . . 5  |-  ( ( A  +c  1o ) 
~~  ~P A  ->  ~P A  ~~  ( A  +c  1o ) )
10 bren 7533 . . . . 5  |-  ( ~P A  ~~  ( A  +c  1o )  <->  E. f 
f : ~P A -1-1-onto-> ( A  +c  1o ) )
119, 10sylib 199 . . . 4  |-  ( ( A  +c  1o ) 
~~  ~P A  ->  E. f 
f : ~P A -1-1-onto-> ( A  +c  1o ) )
12 f1of 5774 . . . . . . . . . 10  |-  ( f : ~P A -1-1-onto-> ( A  +c  1o )  -> 
f : ~P A --> ( A  +c  1o ) )
13 relsdom 7531 . . . . . . . . . . . 12  |-  Rel  ~<
1413brrelex2i 4838 . . . . . . . . . . 11  |-  ( 1o 
~<  A  ->  A  e. 
_V )
15 pwidg 3937 . . . . . . . . . . 11  |-  ( A  e.  _V  ->  A  e.  ~P A )
1614, 15syl 17 . . . . . . . . . 10  |-  ( 1o 
~<  A  ->  A  e. 
~P A )
17 ffvelrn 5979 . . . . . . . . . 10  |-  ( ( f : ~P A --> ( A  +c  1o )  /\  A  e.  ~P A )  ->  (
f `  A )  e.  ( A  +c  1o ) )
1812, 16, 17syl2anr 480 . . . . . . . . 9  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  ->  ( f `  A )  e.  ( A  +c  1o ) )
19 cda1dif 8557 . . . . . . . . 9  |-  ( ( f `  A )  e.  ( A  +c  1o )  ->  ( ( A  +c  1o ) 
\  { ( f `
 A ) } )  ~~  A )
2018, 19syl 17 . . . . . . . 8  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  ->  ( ( A  +c  1o )  \  { ( f `  A ) } ) 
~~  A )
21 bren 7533 . . . . . . . 8  |-  ( ( ( A  +c  1o )  \  { ( f `
 A ) } )  ~~  A  <->  E. g 
g : ( ( A  +c  1o ) 
\  { ( f `
 A ) } ) -1-1-onto-> A )
2220, 21sylib 199 . . . . . . 7  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  ->  E. g  g : ( ( A  +c  1o )  \  { ( f `  A ) } ) -1-1-onto-> A )
23 simpll 758 . . . . . . . . 9  |-  ( ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )  ->  1o  ~<  A )
24 simplr 760 . . . . . . . . 9  |-  ( ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )  ->  f : ~P A -1-1-onto-> ( A  +c  1o ) )
25 simpr 462 . . . . . . . . 9  |-  ( ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )  ->  g : ( ( A  +c  1o )  \  { ( f `  A ) } ) -1-1-onto-> A )
26 eqeq1 2432 . . . . . . . . . . . 12  |-  ( w  =  x  ->  (
w  =  A  <->  x  =  A ) )
27 id 22 . . . . . . . . . . . 12  |-  ( w  =  x  ->  w  =  x )
2826, 27ifbieq2d 3879 . . . . . . . . . . 11  |-  ( w  =  x  ->  if ( w  =  A ,  (/) ,  w )  =  if ( x  =  A ,  (/) ,  x ) )
2928cbvmptv 4459 . . . . . . . . . 10  |-  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) )  =  ( x  e.  ~P A  |->  if ( x  =  A ,  (/) ,  x ) )
3029coeq2i 4957 . . . . . . . . 9  |-  ( ( g  o.  f )  o.  ( w  e. 
~P A  |->  if ( w  =  A ,  (/)
,  w ) ) )  =  ( ( g  o.  f )  o.  ( x  e. 
~P A  |->  if ( x  =  A ,  (/)
,  x ) ) )
31 eqid 2428 . . . . . . . . . 10  |-  { <. a ,  s >.  |  ( ( a  C_  A  /\  s  C_  ( a  X.  a ) )  /\  ( s  We  a  /\  A. z  e.  a  ( (
( g  o.  f
)  o.  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) ) ) `  ( `' s " {
z } ) )  =  z ) ) }  =  { <. a ,  s >.  |  ( ( a  C_  A  /\  s  C_  ( a  X.  a ) )  /\  ( s  We  a  /\  A. z  e.  a  ( (
( g  o.  f
)  o.  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) ) ) `  ( `' s " {
z } ) )  =  z ) ) }
3231fpwwecbv 9020 . . . . . . . . 9  |-  { <. a ,  s >.  |  ( ( a  C_  A  /\  s  C_  ( a  X.  a ) )  /\  ( s  We  a  /\  A. z  e.  a  ( (
( g  o.  f
)  o.  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) ) ) `  ( `' s " {
z } ) )  =  z ) ) }  =  { <. x ,  r >.  |  ( ( x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( (
( g  o.  f
)  o.  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) ) ) `  ( `' r " {
y } ) )  =  y ) ) }
33 eqid 2428 . . . . . . . . 9  |-  U. dom  {
<. a ,  s >.  |  ( ( a 
C_  A  /\  s  C_  ( a  X.  a
) )  /\  (
s  We  a  /\  A. z  e.  a  ( ( ( g  o.  f )  o.  (
w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w
) ) ) `  ( `' s " {
z } ) )  =  z ) ) }  =  U. dom  {
<. a ,  s >.  |  ( ( a 
C_  A  /\  s  C_  ( a  X.  a
) )  /\  (
s  We  a  /\  A. z  e.  a  ( ( ( g  o.  f )  o.  (
w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w
) ) ) `  ( `' s " {
z } ) )  =  z ) ) }
3423, 24, 25, 30, 32, 33canthp1lem2 9029 . . . . . . . 8  |-  -.  (
( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )
3534pm2.21i 134 . . . . . . 7  |-  ( ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )  -> F.  )
3622, 35exlimddv 1774 . . . . . 6  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  -> F.  )
3736ex 435 . . . . 5  |-  ( 1o 
~<  A  ->  ( f : ~P A -1-1-onto-> ( A  +c  1o )  -> F.  ) )
3837exlimdv 1772 . . . 4  |-  ( 1o 
~<  A  ->  ( E. f  f : ~P A
-1-1-onto-> ( A  +c  1o )  -> F.  ) )
3911, 38syl5 33 . . 3  |-  ( 1o 
~<  A  ->  ( ( A  +c  1o ) 
~~  ~P A  -> F.  ) )
408, 39mtoi 181 . 2  |-  ( 1o 
~<  A  ->  -.  ( A  +c  1o )  ~~  ~P A )
41 brsdom 7546 . 2  |-  ( ( A  +c  1o ) 
~<  ~P A  <->  ( ( A  +c  1o )  ~<_  ~P A  /\  -.  ( A  +c  1o )  ~~  ~P A ) )
427, 40, 41sylanbrc 668 1  |-  ( 1o 
~<  A  ->  ( A  +c  1o )  ~<  ~P A )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 370    = wceq 1437   F. wfal 1442   E.wex 1657    e. wcel 1872   A.wral 2714   _Vcvv 3022    \ cdif 3376    C_ wss 3379   (/)c0 3704   ifcif 3854   ~Pcpw 3924   {csn 3941   U.cuni 4162   class class class wbr 4366   {copab 4424    |-> cmpt 4425    We wwe 4754    X. cxp 4794   `'ccnv 4795   dom cdm 4796   "cima 4799    o. ccom 4800   -->wf 5540   -1-1-onto->wf1o 5543   ` cfv 5544  (class class class)co 6249   1oc1o 7130   2oc2o 7131    ~~ cen 7521    ~<_ cdom 7522    ~< csdm 7523    +c ccda 8548
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1663  ax-4 1676  ax-5 1752  ax-6 1798  ax-7 1843  ax-8 1874  ax-9 1876  ax-10 1891  ax-11 1896  ax-12 1909  ax-13 2063  ax-ext 2408  ax-rep 4479  ax-sep 4489  ax-nul 4498  ax-pow 4545  ax-pr 4603  ax-un 6541  ax-inf2 8099
This theorem depends on definitions:  df-bi 188  df-or 371  df-an 372  df-3or 983  df-3an 984  df-tru 1440  df-fal 1443  df-ex 1658  df-nf 1662  df-sb 1791  df-eu 2280  df-mo 2281  df-clab 2415  df-cleq 2421  df-clel 2424  df-nfc 2558  df-ne 2601  df-ral 2719  df-rex 2720  df-reu 2721  df-rmo 2722  df-rab 2723  df-v 3024  df-sbc 3243  df-csb 3339  df-dif 3382  df-un 3384  df-in 3386  df-ss 3393  df-pss 3395  df-nul 3705  df-if 3855  df-pw 3926  df-sn 3942  df-pr 3944  df-tp 3946  df-op 3948  df-uni 4163  df-int 4199  df-iun 4244  df-br 4367  df-opab 4426  df-mpt 4427  df-tr 4462  df-eprel 4707  df-id 4711  df-po 4717  df-so 4718  df-fr 4755  df-se 4756  df-we 4757  df-xp 4802  df-rel 4803  df-cnv 4804  df-co 4805  df-dm 4806  df-rn 4807  df-res 4808  df-ima 4809  df-pred 5342  df-ord 5388  df-on 5389  df-lim 5390  df-suc 5391  df-iota 5508  df-fun 5546  df-fn 5547  df-f 5548  df-f1 5549  df-fo 5550  df-f1o 5551  df-fv 5552  df-isom 5553  df-riota 6211  df-ov 6252  df-oprab 6253  df-mpt2 6254  df-om 6651  df-1st 6751  df-2nd 6752  df-wrecs 6983  df-recs 7045  df-rdg 7083  df-1o 7137  df-2o 7138  df-oadd 7141  df-er 7318  df-map 7429  df-en 7525  df-dom 7526  df-sdom 7527  df-fin 7528  df-oi 7978  df-card 8325  df-cda 8549
This theorem is referenced by:  finngch  9031  gchcda1  9032
  Copyright terms: Public domain W3C validator