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

Theorem alephmul 8944
Description: The product of two alephs is their maximum. Equation 6.1 of [Jech] p. 42. (Contributed by NM, 29-Sep-2004.) (Revised by Mario Carneiro, 30-Apr-2015.)
Assertion
Ref Expression
alephmul  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( aleph `  A
)  X.  ( aleph `  B ) )  ~~  ( ( aleph `  A
)  u.  ( aleph `  B ) ) )

Proof of Theorem alephmul
StepHypRef Expression
1 alephgeom 8454 . . . 4  |-  ( A  e.  On  <->  om  C_  ( aleph `  A ) )
2 fvex 5858 . . . . 5  |-  ( aleph `  A )  e.  _V
3 ssdomg 7554 . . . . 5  |-  ( (
aleph `  A )  e. 
_V  ->  ( om  C_  ( aleph `  A )  ->  om 
~<_  ( aleph `  A )
) )
42, 3ax-mp 5 . . . 4  |-  ( om  C_  ( aleph `  A )  ->  om  ~<_  ( aleph `  A
) )
51, 4sylbi 195 . . 3  |-  ( A  e.  On  ->  om  ~<_  ( aleph `  A ) )
6 alephon 8441 . . . 4  |-  ( aleph `  A )  e.  On
7 onenon 8321 . . . 4  |-  ( (
aleph `  A )  e.  On  ->  ( aleph `  A )  e.  dom  card )
86, 7ax-mp 5 . . 3  |-  ( aleph `  A )  e.  dom  card
95, 8jctil 535 . 2  |-  ( A  e.  On  ->  (
( aleph `  A )  e.  dom  card  /\  om  ~<_  ( aleph `  A ) ) )
10 alephgeom 8454 . . . 4  |-  ( B  e.  On  <->  om  C_  ( aleph `  B ) )
11 fvex 5858 . . . . . 6  |-  ( aleph `  B )  e.  _V
12 ssdomg 7554 . . . . . 6  |-  ( (
aleph `  B )  e. 
_V  ->  ( om  C_  ( aleph `  B )  ->  om 
~<_  ( aleph `  B )
) )
1311, 12ax-mp 5 . . . . 5  |-  ( om  C_  ( aleph `  B )  ->  om  ~<_  ( aleph `  B
) )
14 infn0 7774 . . . . 5  |-  ( om  ~<_  ( aleph `  B )  ->  ( aleph `  B )  =/=  (/) )
1513, 14syl 16 . . . 4  |-  ( om  C_  ( aleph `  B )  ->  ( aleph `  B )  =/=  (/) )
1610, 15sylbi 195 . . 3  |-  ( B  e.  On  ->  ( aleph `  B )  =/=  (/) )
17 alephon 8441 . . . 4  |-  ( aleph `  B )  e.  On
18 onenon 8321 . . . 4  |-  ( (
aleph `  B )  e.  On  ->  ( aleph `  B )  e.  dom  card )
1917, 18ax-mp 5 . . 3  |-  ( aleph `  B )  e.  dom  card
2016, 19jctil 535 . 2  |-  ( B  e.  On  ->  (
( aleph `  B )  e.  dom  card  /\  ( aleph `  B )  =/=  (/) ) )
21 infxp 8586 . 2  |-  ( ( ( ( aleph `  A
)  e.  dom  card  /\ 
om  ~<_  ( aleph `  A
) )  /\  (
( aleph `  B )  e.  dom  card  /\  ( aleph `  B )  =/=  (/) ) )  ->  (
( aleph `  A )  X.  ( aleph `  B )
)  ~~  ( ( aleph `  A )  u.  ( aleph `  B )
) )
229, 20, 21syl2an 475 1  |-  ( ( A  e.  On  /\  B  e.  On )  ->  ( ( aleph `  A
)  X.  ( aleph `  B ) )  ~~  ( ( aleph `  A
)  u.  ( aleph `  B ) ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    /\ wa 367    e. wcel 1823    =/= wne 2649   _Vcvv 3106    u. cun 3459    C_ wss 3461   (/)c0 3783   class class class wbr 4439   Oncon0 4867    X. cxp 4986   dom cdm 4988   ` cfv 5570   omcom 6673    ~~ cen 7506    ~<_ cdom 7507   cardccrd 8307   alephcale 8308
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1623  ax-4 1636  ax-5 1709  ax-6 1752  ax-7 1795  ax-8 1825  ax-9 1827  ax-10 1842  ax-11 1847  ax-12 1859  ax-13 2004  ax-ext 2432  ax-rep 4550  ax-sep 4560  ax-nul 4568  ax-pow 4615  ax-pr 4676  ax-un 6565  ax-inf2 8049
This theorem depends on definitions:  df-bi 185  df-or 368  df-an 369  df-3or 972  df-3an 973  df-tru 1401  df-ex 1618  df-nf 1622  df-sb 1745  df-eu 2288  df-mo 2289  df-clab 2440  df-cleq 2446  df-clel 2449  df-nfc 2604  df-ne 2651  df-ral 2809  df-rex 2810  df-reu 2811  df-rmo 2812  df-rab 2813  df-v 3108  df-sbc 3325  df-csb 3421  df-dif 3464  df-un 3466  df-in 3468  df-ss 3475  df-pss 3477  df-nul 3784  df-if 3930  df-pw 4001  df-sn 4017  df-pr 4019  df-tp 4021  df-op 4023  df-uni 4236  df-int 4272  df-iun 4317  df-br 4440  df-opab 4498  df-mpt 4499  df-tr 4533  df-eprel 4780  df-id 4784  df-po 4789  df-so 4790  df-fr 4827  df-se 4828  df-we 4829  df-ord 4870  df-on 4871  df-lim 4872  df-suc 4873  df-xp 4994  df-rel 4995  df-cnv 4996  df-co 4997  df-dm 4998  df-rn 4999  df-res 5000  df-ima 5001  df-iota 5534  df-fun 5572  df-fn 5573  df-f 5574  df-f1 5575  df-fo 5576  df-f1o 5577  df-fv 5578  df-isom 5579  df-riota 6232  df-ov 6273  df-oprab 6274  df-mpt2 6275  df-om 6674  df-1st 6773  df-2nd 6774  df-recs 7034  df-rdg 7068  df-1o 7122  df-2o 7123  df-oadd 7126  df-er 7303  df-en 7510  df-dom 7511  df-sdom 7512  df-fin 7513  df-oi 7927  df-har 7976  df-card 8311  df-aleph 8312  df-cda 8539
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator