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

Theorem gchcdaidm 8499
Description: An infinite GCH-set is idempotent under cardinal sum. Part of Lemma 2.2 of [KanamoriPincus] p. 419. (Contributed by Mario Carneiro, 31-May-2015.)
Assertion
Ref Expression
gchcdaidm  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  A
)  ~~  A )

Proof of Theorem gchcdaidm
StepHypRef Expression
1 simpl 444 . . . . 5  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  A  e. GCH )
2 cdadom3 8024 . . . . 5  |-  ( ( A  e. GCH  /\  A  e. GCH )  ->  A  ~<_  ( A  +c  A ) )
31, 1, 2syl2anc 643 . . . 4  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  A  ~<_  ( A  +c  A ) )
4 canth2g 7220 . . . . . . . . 9  |-  ( A  e. GCH  ->  A  ~<  ~P A
)
54adantr 452 . . . . . . . 8  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  A  ~<  ~P A
)
6 sdomdom 7094 . . . . . . . 8  |-  ( A 
~<  ~P A  ->  A  ~<_  ~P A )
75, 6syl 16 . . . . . . 7  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  A  ~<_  ~P A )
8 cdadom1 8022 . . . . . . . 8  |-  ( A  ~<_  ~P A  ->  ( A  +c  A )  ~<_  ( ~P A  +c  A
) )
9 cdadom2 8023 . . . . . . . 8  |-  ( A  ~<_  ~P A  ->  ( ~P A  +c  A
)  ~<_  ( ~P A  +c  ~P A ) )
10 domtr 7119 . . . . . . . 8  |-  ( ( ( A  +c  A
)  ~<_  ( ~P A  +c  A )  /\  ( ~P A  +c  A
)  ~<_  ( ~P A  +c  ~P A ) )  ->  ( A  +c  A )  ~<_  ( ~P A  +c  ~P A
) )
118, 9, 10syl2anc 643 . . . . . . 7  |-  ( A  ~<_  ~P A  ->  ( A  +c  A )  ~<_  ( ~P A  +c  ~P A ) )
127, 11syl 16 . . . . . 6  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  A
)  ~<_  ( ~P A  +c  ~P A ) )
13 pwcda1 8030 . . . . . . . 8  |-  ( A  e. GCH  ->  ( ~P A  +c  ~P A )  ~~  ~P ( A  +c  1o ) )
1413adantr 452 . . . . . . 7  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( ~P A  +c  ~P A )  ~~  ~P ( A  +c  1o ) )
15 gchcda1 8487 . . . . . . . 8  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  1o )  ~~  A )
16 pwen 7239 . . . . . . . 8  |-  ( ( A  +c  1o ) 
~~  A  ->  ~P ( A  +c  1o )  ~~  ~P A )
1715, 16syl 16 . . . . . . 7  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ~P ( A  +c  1o )  ~~  ~P A
)
18 entr 7118 . . . . . . 7  |-  ( ( ( ~P A  +c  ~P A )  ~~  ~P ( A  +c  1o )  /\  ~P ( A  +c  1o )  ~~  ~P A )  ->  ( ~P A  +c  ~P A
)  ~~  ~P A
)
1914, 17, 18syl2anc 643 . . . . . 6  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( ~P A  +c  ~P A )  ~~  ~P A )
20 domentr 7125 . . . . . 6  |-  ( ( ( A  +c  A
)  ~<_  ( ~P A  +c  ~P A )  /\  ( ~P A  +c  ~P A )  ~~  ~P A )  ->  ( A  +c  A )  ~<_  ~P A )
2112, 19, 20syl2anc 643 . . . . 5  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  A
)  ~<_  ~P A )
22 gchinf 8488 . . . . . . 7  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  om  ~<_  A )
23 pwcdandom 8498 . . . . . . 7  |-  ( om  ~<_  A  ->  -.  ~P A  ~<_  ( A  +c  A
) )
2422, 23syl 16 . . . . . 6  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  -.  ~P A  ~<_  ( A  +c  A ) )
25 ensym 7115 . . . . . . 7  |-  ( ( A  +c  A ) 
~~  ~P A  ->  ~P A  ~~  ( A  +c  A ) )
26 endom 7093 . . . . . . 7  |-  ( ~P A  ~~  ( A  +c  A )  ->  ~P A  ~<_  ( A  +c  A ) )
2725, 26syl 16 . . . . . 6  |-  ( ( A  +c  A ) 
~~  ~P A  ->  ~P A  ~<_  ( A  +c  A ) )
2824, 27nsyl 115 . . . . 5  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  -.  ( A  +c  A )  ~~  ~P A )
29 brsdom 7089 . . . . 5  |-  ( ( A  +c  A ) 
~<  ~P A  <->  ( ( A  +c  A )  ~<_  ~P A  /\  -.  ( A  +c  A )  ~~  ~P A ) )
3021, 28, 29sylanbrc 646 . . . 4  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  A
)  ~<  ~P A )
313, 30jca 519 . . 3  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  ~<_  ( A  +c  A )  /\  ( A  +c  A
)  ~<  ~P A ) )
32 gchen1 8456 . . 3  |-  ( ( ( A  e. GCH  /\  -.  A  e.  Fin )  /\  ( A  ~<_  ( A  +c  A )  /\  ( A  +c  A )  ~<  ~P A
) )  ->  A  ~~  ( A  +c  A
) )
3331, 32mpdan 650 . 2  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  A  ~~  ( A  +c  A ) )
3433ensymd 7117 1  |-  ( ( A  e. GCH  /\  -.  A  e.  Fin )  ->  ( A  +c  A
)  ~~  A )
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    /\ wa 359    e. wcel 1721   ~Pcpw 3759   class class class wbr 4172   omcom 4804  (class class class)co 6040   1oc1o 6676    ~~ cen 7065    ~<_ cdom 7066    ~< csdm 7067   Fincfn 7068    +c ccda 8003  GCHcgch 8451
This theorem is referenced by:  gchxpidm  8500  gchhar  8502  gchpwdom  8505
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  ax-inf2 7552
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1325  df-fal 1326  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-om 4805  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-oprab 6044  df-mpt2 6045  df-1st 6308  df-2nd 6309  df-riota 6508  df-recs 6592  df-rdg 6627  df-seqom 6664  df-1o 6683  df-2o 6684  df-oadd 6687  df-omul 6688  df-oexp 6689  df-er 6864  df-map 6979  df-en 7069  df-dom 7070  df-sdom 7071  df-fin 7072  df-oi 7435  df-har 7482  df-cnf 7573  df-card 7782  df-cda 8004  df-fin4 8123  df-gch 8452
  Copyright terms: Public domain W3C validator