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

Theorem canth4 8478
Description: An "effective" form of Cantor's theorem canth 6498. For any function  F from the powerset of  A to  A, there are two definable sets  B and  C which witness non-injectivity of  F. Corollary 1.3 of [KanamoriPincus] p. 416. (Contributed by Mario Carneiro, 18-May-2015.)
Hypotheses
Ref Expression
canth4.1  |-  W  =  { <. x ,  r
>.  |  ( (
x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( F `  ( `' r " { y } ) )  =  y ) ) }
canth4.2  |-  B  = 
U. dom  W
canth4.3  |-  C  =  ( `' ( W `
 B ) " { ( F `  B ) } )
Assertion
Ref Expression
canth4  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( B  C_  A  /\  C  C.  B  /\  ( F `  B )  =  ( F `  C ) ) )
Distinct variable groups:    x, r,
y, A    B, r, x, y    D, r, x, y    F, r, x, y    V, r, x, y    y, C    W, r, x, y
Allowed substitution hints:    C( x, r)

Proof of Theorem canth4
StepHypRef Expression
1 eqid 2404 . . . . . . . 8  |-  B  =  B
2 eqid 2404 . . . . . . . 8  |-  ( W `
 B )  =  ( W `  B
)
31, 2pm3.2i 442 . . . . . . 7  |-  ( B  =  B  /\  ( W `  B )  =  ( W `  B ) )
4 canth4.1 . . . . . . . 8  |-  W  =  { <. x ,  r
>.  |  ( (
x  C_  A  /\  r  C_  ( x  X.  x ) )  /\  ( r  We  x  /\  A. y  e.  x  ( F `  ( `' r " { y } ) )  =  y ) ) }
5 elex 2924 . . . . . . . . 9  |-  ( A  e.  V  ->  A  e.  _V )
653ad2ant1 978 . . . . . . . 8  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  A  e.  _V )
7 simpl2 961 . . . . . . . . 9  |-  ( ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  /\  x  e.  ( ~P A  i^i  dom  card ) )  ->  F : D --> A )
8 simp3 959 . . . . . . . . . 10  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( ~P A  i^i  dom 
card )  C_  D
)
98sselda 3308 . . . . . . . . 9  |-  ( ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  /\  x  e.  ( ~P A  i^i  dom  card ) )  ->  x  e.  D )
107, 9ffvelrnd 5830 . . . . . . . 8  |-  ( ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  /\  x  e.  ( ~P A  i^i  dom  card ) )  ->  ( F `  x )  e.  A )
11 canth4.2 . . . . . . . 8  |-  B  = 
U. dom  W
124, 6, 10, 11fpwwe 8477 . . . . . . 7  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( ( B W ( W `  B
)  /\  ( F `  B )  e.  B
)  <->  ( B  =  B  /\  ( W `
 B )  =  ( W `  B
) ) ) )
133, 12mpbiri 225 . . . . . 6  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( B W ( W `  B )  /\  ( F `  B )  e.  B
) )
1413simpld 446 . . . . 5  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  B W ( W `
 B ) )
154, 6fpwwelem 8476 . . . . 5  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( B W ( W `  B )  <-> 
( ( B  C_  A  /\  ( W `  B )  C_  ( B  X.  B ) )  /\  ( ( W `
 B )  We  B  /\  A. y  e.  B  ( F `  ( `' ( W `
 B ) " { y } ) )  =  y ) ) ) )
1614, 15mpbid 202 . . . 4  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( ( B  C_  A  /\  ( W `  B )  C_  ( B  X.  B ) )  /\  ( ( W `
 B )  We  B  /\  A. y  e.  B  ( F `  ( `' ( W `
 B ) " { y } ) )  =  y ) ) )
1716simpld 446 . . 3  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( B  C_  A  /\  ( W `  B
)  C_  ( B  X.  B ) ) )
1817simpld 446 . 2  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  B  C_  A )
19 canth4.3 . . . . 5  |-  C  =  ( `' ( W `
 B ) " { ( F `  B ) } )
20 cnvimass 5183 . . . . 5  |-  ( `' ( W `  B
) " { ( F `  B ) } )  C_  dom  ( W `  B )
2119, 20eqsstri 3338 . . . 4  |-  C  C_  dom  ( W `  B
)
2217simprd 450 . . . . . 6  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( W `  B
)  C_  ( B  X.  B ) )
23 dmss 5028 . . . . . 6  |-  ( ( W `  B ) 
C_  ( B  X.  B )  ->  dom  ( W `  B ) 
C_  dom  ( B  X.  B ) )
2422, 23syl 16 . . . . 5  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  dom  ( W `  B )  C_  dom  ( B  X.  B
) )
25 dmxpid 5048 . . . . 5  |-  dom  ( B  X.  B )  =  B
2624, 25syl6sseq 3354 . . . 4  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  dom  ( W `  B )  C_  B
)
2721, 26syl5ss 3319 . . 3  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  C  C_  B )
2813simprd 450 . . 3  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( F `  B
)  e.  B )
2916simprd 450 . . . . . . 7  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( ( W `  B )  We  B  /\  A. y  e.  B  ( F `  ( `' ( W `  B
) " { y } ) )  =  y ) )
3029simpld 446 . . . . . 6  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( W `  B
)  We  B )
31 weso 4533 . . . . . 6  |-  ( ( W `  B )  We  B  ->  ( W `  B )  Or  B )
3230, 31syl 16 . . . . 5  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( W `  B
)  Or  B )
33 sonr 4484 . . . . 5  |-  ( ( ( W `  B
)  Or  B  /\  ( F `  B )  e.  B )  ->  -.  ( F `  B
) ( W `  B ) ( F `
 B ) )
3432, 28, 33syl2anc 643 . . . 4  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  -.  ( F `  B ) ( W `
 B ) ( F `  B ) )
3519eleq2i 2468 . . . . 5  |-  ( ( F `  B )  e.  C  <->  ( F `  B )  e.  ( `' ( W `  B ) " {
( F `  B
) } ) )
36 fvex 5701 . . . . . 6  |-  ( F `
 B )  e. 
_V
3736eliniseg 5192 . . . . . 6  |-  ( ( F `  B )  e.  _V  ->  (
( F `  B
)  e.  ( `' ( W `  B
) " { ( F `  B ) } )  <->  ( F `  B ) ( W `
 B ) ( F `  B ) ) )
3836, 37ax-mp 8 . . . . 5  |-  ( ( F `  B )  e.  ( `' ( W `  B )
" { ( F `
 B ) } )  <->  ( F `  B ) ( W `
 B ) ( F `  B ) )
3935, 38bitri 241 . . . 4  |-  ( ( F `  B )  e.  C  <->  ( F `  B ) ( W `
 B ) ( F `  B ) )
4034, 39sylnibr 297 . . 3  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  -.  ( F `  B )  e.  C
)
4127, 28, 40ssnelpssd 3652 . 2  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  C  C.  B )
4229simprd 450 . . . 4  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  A. y  e.  B  ( F `  ( `' ( W `  B
) " { y } ) )  =  y )
43 sneq 3785 . . . . . . . . 9  |-  ( y  =  ( F `  B )  ->  { y }  =  { ( F `  B ) } )
4443imaeq2d 5162 . . . . . . . 8  |-  ( y  =  ( F `  B )  ->  ( `' ( W `  B ) " {
y } )  =  ( `' ( W `
 B ) " { ( F `  B ) } ) )
4544, 19syl6eqr 2454 . . . . . . 7  |-  ( y  =  ( F `  B )  ->  ( `' ( W `  B ) " {
y } )  =  C )
4645fveq2d 5691 . . . . . 6  |-  ( y  =  ( F `  B )  ->  ( F `  ( `' ( W `  B )
" { y } ) )  =  ( F `  C ) )
47 id 20 . . . . . 6  |-  ( y  =  ( F `  B )  ->  y  =  ( F `  B ) )
4846, 47eqeq12d 2418 . . . . 5  |-  ( y  =  ( F `  B )  ->  (
( F `  ( `' ( W `  B ) " {
y } ) )  =  y  <->  ( F `  C )  =  ( F `  B ) ) )
4948rspcv 3008 . . . 4  |-  ( ( F `  B )  e.  B  ->  ( A. y  e.  B  ( F `  ( `' ( W `  B
) " { y } ) )  =  y  ->  ( F `  C )  =  ( F `  B ) ) )
5028, 42, 49sylc 58 . . 3  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( F `  C
)  =  ( F `
 B ) )
5150eqcomd 2409 . 2  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( F `  B
)  =  ( F `
 C ) )
5218, 41, 513jca 1134 1  |-  ( ( A  e.  V  /\  F : D --> A  /\  ( ~P A  i^i  dom  card )  C_  D )  ->  ( B  C_  A  /\  C  C.  B  /\  ( F `  B )  =  ( F `  C ) ) )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    /\ w3a 936    = wceq 1649    e. wcel 1721   A.wral 2666   _Vcvv 2916    i^i cin 3279    C_ wss 3280    C. wpss 3281   ~Pcpw 3759   {csn 3774   U.cuni 3975   class class class wbr 4172   {copab 4225    Or wor 4462    We wwe 4500    X. cxp 4835   `'ccnv 4836   dom cdm 4837   "cima 4840   -->wf 5409   ` cfv 5413   cardccrd 7778
This theorem is referenced by:  canthnumlem  8479  canthp1lem2  8484
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1552  ax-5 1563  ax-17 1623  ax-9 1662  ax-8 1683  ax-13 1723  ax-14 1725  ax-6 1740  ax-7 1745  ax-11 1757  ax-12 1946  ax-ext 2385  ax-rep 4280  ax-sep 4290  ax-nul 4298  ax-pow 4337  ax-pr 4363  ax-un 4660
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-ex 1548  df-nf 1551  df-sb 1656  df-eu 2258  df-mo 2259  df-clab 2391  df-cleq 2397  df-clel 2400  df-nfc 2529  df-ne 2569  df-ral 2671  df-rex 2672  df-reu 2673  df-rmo 2674  df-rab 2675  df-v 2918  df-sbc 3122  df-csb 3212  df-dif 3283  df-un 3285  df-in 3287  df-ss 3294  df-pss 3296  df-nul 3589  df-if 3700  df-pw 3761  df-sn 3780  df-pr 3781  df-tp 3782  df-op 3783  df-uni 3976  df-int 4011  df-iun 4055  df-br 4173  df-opab 4227  df-mpt 4228  df-tr 4263  df-eprel 4454  df-id 4458  df-po 4463  df-so 4464  df-fr 4501  df-se 4502  df-we 4503  df-ord 4544  df-on 4545  df-lim 4546  df-suc 4547  df-xp 4843  df-rel 4844  df-cnv 4845  df-co 4846  df-dm 4847  df-rn 4848  df-res 4849  df-ima 4850  df-iota 5377  df-fun 5415  df-fn 5416  df-f 5417  df-f1 5418  df-fo 5419  df-f1o 5420  df-fv 5421  df-isom 5422  df-ov 6043  df-1st 6308  df-riota 6508  df-recs 6592  df-en 7069  df-oi 7435  df-card 7782
  Copyright terms: Public domain W3C validator