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

Theorem canthp1 8826
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 7516 . . . 4  |-  1o  ~<  2o
2 sdomdom 7342 . . . 4  |-  ( 1o 
~<  2o  ->  1o  ~<_  2o )
3 cdadom2 8361 . . . 4  |-  ( 1o  ~<_  2o  ->  ( A  +c  1o )  ~<_  ( A  +c  2o ) )
41, 2, 3mp2b 10 . . 3  |-  ( A  +c  1o )  ~<_  ( A  +c  2o )
5 canthp1lem1 8824 . . 3  |-  ( 1o 
~<  A  ->  ( A  +c  2o )  ~<_  ~P A )
6 domtr 7367 . . 3  |-  ( ( ( A  +c  1o )  ~<_  ( A  +c  2o )  /\  ( A  +c  2o )  ~<_  ~P A )  ->  ( A  +c  1o )  ~<_  ~P A )
74, 5, 6sylancr 663 . 2  |-  ( 1o 
~<  A  ->  ( A  +c  1o )  ~<_  ~P A )
8 fal 1376 . . 3  |-  -. F.
9 ensym 7363 . . . . 5  |-  ( ( A  +c  1o ) 
~~  ~P A  ->  ~P A  ~~  ( A  +c  1o ) )
10 bren 7324 . . . . 5  |-  ( ~P A  ~~  ( A  +c  1o )  <->  E. f 
f : ~P A -1-1-onto-> ( A  +c  1o ) )
119, 10sylib 196 . . . 4  |-  ( ( A  +c  1o ) 
~~  ~P A  ->  E. f 
f : ~P A -1-1-onto-> ( A  +c  1o ) )
12 f1of 5646 . . . . . . . . . 10  |-  ( f : ~P A -1-1-onto-> ( A  +c  1o )  -> 
f : ~P A --> ( A  +c  1o ) )
13 relsdom 7322 . . . . . . . . . . . 12  |-  Rel  ~<
1413brrelex2i 4885 . . . . . . . . . . 11  |-  ( 1o 
~<  A  ->  A  e. 
_V )
15 pwidg 3878 . . . . . . . . . . 11  |-  ( A  e.  _V  ->  A  e.  ~P A )
1614, 15syl 16 . . . . . . . . . 10  |-  ( 1o 
~<  A  ->  A  e. 
~P A )
17 ffvelrn 5846 . . . . . . . . . 10  |-  ( ( f : ~P A --> ( A  +c  1o )  /\  A  e.  ~P A )  ->  (
f `  A )  e.  ( A  +c  1o ) )
1812, 16, 17syl2anr 478 . . . . . . . . 9  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  ->  ( f `  A )  e.  ( A  +c  1o ) )
19 cda1dif 8350 . . . . . . . . 9  |-  ( ( f `  A )  e.  ( A  +c  1o )  ->  ( ( A  +c  1o ) 
\  { ( f `
 A ) } )  ~~  A )
2018, 19syl 16 . . . . . . . 8  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  ->  ( ( A  +c  1o )  \  { ( f `  A ) } ) 
~~  A )
21 bren 7324 . . . . . . . 8  |-  ( ( ( A  +c  1o )  \  { ( f `
 A ) } )  ~~  A  <->  E. g 
g : ( ( A  +c  1o ) 
\  { ( f `
 A ) } ) -1-1-onto-> A )
2220, 21sylib 196 . . . . . . 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 753 . . . . . . . . 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 754 . . . . . . . . 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 461 . . . . . . . . 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 2449 . . . . . . . . . . . 12  |-  ( w  =  x  ->  (
w  =  A  <->  x  =  A ) )
27 id 22 . . . . . . . . . . . 12  |-  ( w  =  x  ->  w  =  x )
2826, 27ifbieq2d 3819 . . . . . . . . . . 11  |-  ( w  =  x  ->  if ( w  =  A ,  (/) ,  w )  =  if ( x  =  A ,  (/) ,  x ) )
2928cbvmptv 4388 . . . . . . . . . 10  |-  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) )  =  ( x  e.  ~P A  |->  if ( x  =  A ,  (/) ,  x ) )
3029coeq2i 5005 . . . . . . . . 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 2443 . . . . . . . . . 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 8816 . . . . . . . . 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 2443 . . . . . . . . 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 8825 . . . . . . . 8  |-  -.  (
( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  /\  g : ( ( A  +c  1o )  \  { ( f `
 A ) } ) -1-1-onto-> A )
3534pm2.21i 131 . . . . . . 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 1692 . . . . . 6  |-  ( ( 1o  ~<  A  /\  f : ~P A -1-1-onto-> ( A  +c  1o ) )  -> F.  )
3736ex 434 . . . . 5  |-  ( 1o 
~<  A  ->  ( f : ~P A -1-1-onto-> ( A  +c  1o )  -> F.  ) )
3837exlimdv 1690 . . . 4  |-  ( 1o 
~<  A  ->  ( E. f  f : ~P A
-1-1-onto-> ( A  +c  1o )  -> F.  ) )
3911, 38syl5 32 . . 3  |-  ( 1o 
~<  A  ->  ( ( A  +c  1o ) 
~~  ~P A  -> F.  ) )
408, 39mtoi 178 . 2  |-  ( 1o 
~<  A  ->  -.  ( A  +c  1o )  ~~  ~P A )
41 brsdom 7337 . 2  |-  ( ( A  +c  1o ) 
~<  ~P A  <->  ( ( A  +c  1o )  ~<_  ~P A  /\  -.  ( A  +c  1o )  ~~  ~P A ) )
427, 40, 41sylanbrc 664 1  |-  ( 1o 
~<  A  ->  ( A  +c  1o )  ~<  ~P A )
Colors of variables: wff setvar class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 369    = wceq 1369   F. wfal 1374   E.wex 1586    e. wcel 1756   A.wral 2720   _Vcvv 2977    \ cdif 3330    C_ wss 3333   (/)c0 3642   ifcif 3796   ~Pcpw 3865   {csn 3882   U.cuni 4096   class class class wbr 4297   {copab 4354    e. cmpt 4355    We wwe 4683    X. cxp 4843   `'ccnv 4844   dom cdm 4845   "cima 4848    o. ccom 4849   -->wf 5419   -1-1-onto->wf1o 5422   ` cfv 5423  (class class class)co 6096   1oc1o 6918   2oc2o 6919    ~~ cen 7312    ~<_ cdom 7313    ~< csdm 7314    +c ccda 8341
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1591  ax-4 1602  ax-5 1670  ax-6 1708  ax-7 1728  ax-8 1758  ax-9 1760  ax-10 1775  ax-11 1780  ax-12 1792  ax-13 1943  ax-ext 2423  ax-rep 4408  ax-sep 4418  ax-nul 4426  ax-pow 4475  ax-pr 4536  ax-un 6377  ax-inf2 7852
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 966  df-3an 967  df-tru 1372  df-fal 1375  df-ex 1587  df-nf 1590  df-sb 1701  df-eu 2257  df-mo 2258  df-clab 2430  df-cleq 2436  df-clel 2439  df-nfc 2573  df-ne 2613  df-ral 2725  df-rex 2726  df-reu 2727  df-rmo 2728  df-rab 2729  df-v 2979  df-sbc 3192  df-csb 3294  df-dif 3336  df-un 3338  df-in 3340  df-ss 3347  df-pss 3349  df-nul 3643  df-if 3797  df-pw 3867  df-sn 3883  df-pr 3885  df-tp 3887  df-op 3889  df-uni 4097  df-int 4134  df-iun 4178  df-br 4298  df-opab 4356  df-mpt 4357  df-tr 4391  df-eprel 4637  df-id 4641  df-po 4646  df-so 4647  df-fr 4684  df-se 4685  df-we 4686  df-ord 4727  df-on 4728  df-lim 4729  df-suc 4730  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-iota 5386  df-fun 5425  df-fn 5426  df-f 5427  df-f1 5428  df-fo 5429  df-f1o 5430  df-fv 5431  df-isom 5432  df-riota 6057  df-ov 6099  df-oprab 6100  df-mpt2 6101  df-om 6482  df-1st 6582  df-2nd 6583  df-recs 6837  df-rdg 6871  df-1o 6925  df-2o 6926  df-oadd 6929  df-er 7106  df-map 7221  df-en 7316  df-dom 7317  df-sdom 7318  df-fin 7319  df-oi 7729  df-card 8114  df-cda 8342
This theorem is referenced by:  finngch  8827  gchcda1  8828
  Copyright terms: Public domain W3C validator