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

Theorem canthp1 9049
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 7737 . . . 4  |-  1o  ~<  2o
2 sdomdom 7562 . . . 4  |-  ( 1o 
~<  2o  ->  1o  ~<_  2o )
3 cdadom2 8584 . . . 4  |-  ( 1o  ~<_  2o  ->  ( A  +c  1o )  ~<_  ( A  +c  2o ) )
41, 2, 3mp2b 10 . . 3  |-  ( A  +c  1o )  ~<_  ( A  +c  2o )
5 canthp1lem1 9047 . . 3  |-  ( 1o 
~<  A  ->  ( A  +c  2o )  ~<_  ~P A )
6 domtr 7587 . . 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 1402 . . 3  |-  -. F.
9 ensym 7583 . . . . 5  |-  ( ( A  +c  1o ) 
~~  ~P A  ->  ~P A  ~~  ( A  +c  1o ) )
10 bren 7544 . . . . 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 5822 . . . . . . . . . 10  |-  ( f : ~P A -1-1-onto-> ( A  +c  1o )  -> 
f : ~P A --> ( A  +c  1o ) )
13 relsdom 7542 . . . . . . . . . . . 12  |-  Rel  ~<
1413brrelex2i 5050 . . . . . . . . . . 11  |-  ( 1o 
~<  A  ->  A  e. 
_V )
15 pwidg 4028 . . . . . . . . . . 11  |-  ( A  e.  _V  ->  A  e.  ~P A )
1614, 15syl 16 . . . . . . . . . 10  |-  ( 1o 
~<  A  ->  A  e. 
~P A )
17 ffvelrn 6030 . . . . . . . . . 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 8573 . . . . . . . . 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 7544 . . . . . . . 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 755 . . . . . . . . 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 2461 . . . . . . . . . . . 12  |-  ( w  =  x  ->  (
w  =  A  <->  x  =  A ) )
27 id 22 . . . . . . . . . . . 12  |-  ( w  =  x  ->  w  =  x )
2826, 27ifbieq2d 3969 . . . . . . . . . . 11  |-  ( w  =  x  ->  if ( w  =  A ,  (/) ,  w )  =  if ( x  =  A ,  (/) ,  x ) )
2928cbvmptv 4548 . . . . . . . . . 10  |-  ( w  e.  ~P A  |->  if ( w  =  A ,  (/) ,  w ) )  =  ( x  e.  ~P A  |->  if ( x  =  A ,  (/) ,  x ) )
3029coeq2i 5173 . . . . . . . . 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 2457 . . . . . . . . . 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 9039 . . . . . . . . 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 2457 . . . . . . . . 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 9048 . . . . . . . 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 1727 . . . . . 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 1725 . . . 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 7557 . 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 1395   F. wfal 1400   E.wex 1613    e. wcel 1819   A.wral 2807   _Vcvv 3109    \ cdif 3468    C_ wss 3471   (/)c0 3793   ifcif 3944   ~Pcpw 4015   {csn 4032   U.cuni 4251   class class class wbr 4456   {copab 4514    |-> cmpt 4515    We wwe 4846    X. cxp 5006   `'ccnv 5007   dom cdm 5008   "cima 5011    o. ccom 5012   -->wf 5590   -1-1-onto->wf1o 5593   ` cfv 5594  (class class class)co 6296   1oc1o 7141   2oc2o 7142    ~~ cen 7532    ~<_ cdom 7533    ~< csdm 7534    +c ccda 8564
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1619  ax-4 1632  ax-5 1705  ax-6 1748  ax-7 1791  ax-8 1821  ax-9 1823  ax-10 1838  ax-11 1843  ax-12 1855  ax-13 2000  ax-ext 2435  ax-rep 4568  ax-sep 4578  ax-nul 4586  ax-pow 4634  ax-pr 4695  ax-un 6591  ax-inf2 8075
This theorem depends on definitions:  df-bi 185  df-or 370  df-an 371  df-3or 974  df-3an 975  df-tru 1398  df-fal 1401  df-ex 1614  df-nf 1618  df-sb 1741  df-eu 2287  df-mo 2288  df-clab 2443  df-cleq 2449  df-clel 2452  df-nfc 2607  df-ne 2654  df-ral 2812  df-rex 2813  df-reu 2814  df-rmo 2815  df-rab 2816  df-v 3111  df-sbc 3328  df-csb 3431  df-dif 3474  df-un 3476  df-in 3478  df-ss 3485  df-pss 3487  df-nul 3794  df-if 3945  df-pw 4017  df-sn 4033  df-pr 4035  df-tp 4037  df-op 4039  df-uni 4252  df-int 4289  df-iun 4334  df-br 4457  df-opab 4516  df-mpt 4517  df-tr 4551  df-eprel 4800  df-id 4804  df-po 4809  df-so 4810  df-fr 4847  df-se 4848  df-we 4849  df-ord 4890  df-on 4891  df-lim 4892  df-suc 4893  df-xp 5014  df-rel 5015  df-cnv 5016  df-co 5017  df-dm 5018  df-rn 5019  df-res 5020  df-ima 5021  df-iota 5557  df-fun 5596  df-fn 5597  df-f 5598  df-f1 5599  df-fo 5600  df-f1o 5601  df-fv 5602  df-isom 5603  df-riota 6258  df-ov 6299  df-oprab 6300  df-mpt2 6301  df-om 6700  df-1st 6799  df-2nd 6800  df-recs 7060  df-rdg 7094  df-1o 7148  df-2o 7149  df-oadd 7152  df-er 7329  df-map 7440  df-en 7536  df-dom 7537  df-sdom 7538  df-fin 7539  df-oi 7953  df-card 8337  df-cda 8565
This theorem is referenced by:  finngch  9050  gchcda1  9051
  Copyright terms: Public domain W3C validator