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

Theorem infxp 8087
Description: Absorption law for multiplication with an infinite cardinal. Equivalent to Proposition 10.41 of [TakeutiZaring] p. 95. (Contributed by NM, 28-Sep-2004.) (Revised by Mario Carneiro, 29-Apr-2015.)
Assertion
Ref Expression
infxp  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( A  X.  B )  ~~  ( A  u.  B )
)

Proof of Theorem infxp
StepHypRef Expression
1 sdomdom 7127 . . 3  |-  ( B 
~<  A  ->  B  ~<_  A )
2 infxpabs 8084 . . . . . 6  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  =/=  (/)  /\  B  ~<_  A ) )  -> 
( A  X.  B
)  ~~  A )
3 infunabs 8079 . . . . . . . . 9  |-  ( ( A  e.  dom  card  /\ 
om  ~<_  A  /\  B  ~<_  A )  ->  ( A  u.  B )  ~~  A )
433expa 1153 . . . . . . . 8  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  B  ~<_  A )  -> 
( A  u.  B
)  ~~  A )
54adantrl 697 . . . . . . 7  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  =/=  (/)  /\  B  ~<_  A ) )  -> 
( A  u.  B
)  ~~  A )
65ensymd 7150 . . . . . 6  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  =/=  (/)  /\  B  ~<_  A ) )  ->  A  ~~  ( A  u.  B ) )
7 entr 7151 . . . . . 6  |-  ( ( ( A  X.  B
)  ~~  A  /\  A  ~~  ( A  u.  B ) )  -> 
( A  X.  B
)  ~~  ( A  u.  B ) )
82, 6, 7syl2anc 643 . . . . 5  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  =/=  (/)  /\  B  ~<_  A ) )  -> 
( A  X.  B
)  ~~  ( A  u.  B ) )
98expr 599 . . . 4  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  B  =/=  (/) )  ->  ( B  ~<_  A  ->  ( A  X.  B )  ~~  ( A  u.  B
) ) )
109adantrl 697 . . 3  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( B  ~<_  A  ->  ( A  X.  B )  ~~  ( A  u.  B )
) )
111, 10syl5 30 . 2  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( B  ~<  A  ->  ( A  X.  B )  ~~  ( A  u.  B )
) )
12 domtri2 7868 . . . 4  |-  ( ( A  e.  dom  card  /\  B  e.  dom  card )  ->  ( A  ~<_  B  <->  -.  B  ~<  A ) )
1312ad2ant2r 728 . . 3  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( A  ~<_  B  <->  -.  B  ~<  A ) )
14 xpcomeng 7192 . . . . . . 7  |-  ( ( A  e.  dom  card  /\  B  e.  dom  card )  ->  ( A  X.  B )  ~~  ( B  X.  A ) )
1514ad2ant2r 728 . . . . . 6  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( A  X.  B )  ~~  ( B  X.  A ) )
1615adantr 452 . . . . 5  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( A  X.  B )  ~~  ( B  X.  A
) )
17 simplrl 737 . . . . . . 7  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  B  e.  dom  card )
18 simplr 732 . . . . . . . 8  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  om  ~<_  A )
19 domtr 7152 . . . . . . . 8  |-  ( ( om  ~<_  A  /\  A  ~<_  B )  ->  om  ~<_  B )
2018, 19sylan 458 . . . . . . 7  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  om  ~<_  B )
21 infn0 7361 . . . . . . . 8  |-  ( om  ~<_  A  ->  A  =/=  (/) )
2221ad3antlr 712 . . . . . . 7  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  A  =/=  (/) )
23 simpr 448 . . . . . . 7  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  A  ~<_  B )
24 infxpabs 8084 . . . . . . 7  |-  ( ( ( B  e.  dom  card  /\  om  ~<_  B )  /\  ( A  =/=  (/)  /\  A  ~<_  B ) )  -> 
( B  X.  A
)  ~~  B )
2517, 20, 22, 23, 24syl22anc 1185 . . . . . 6  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( B  X.  A )  ~~  B )
26 uncom 3483 . . . . . . . 8  |-  ( A  u.  B )  =  ( B  u.  A
)
27 infunabs 8079 . . . . . . . . 9  |-  ( ( B  e.  dom  card  /\ 
om  ~<_  B  /\  A  ~<_  B )  ->  ( B  u.  A )  ~~  B )
2817, 20, 23, 27syl3anc 1184 . . . . . . . 8  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( B  u.  A )  ~~  B )
2926, 28syl5eqbr 4237 . . . . . . 7  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( A  u.  B )  ~~  B )
3029ensymd 7150 . . . . . 6  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  B  ~~  ( A  u.  B
) )
31 entr 7151 . . . . . 6  |-  ( ( ( B  X.  A
)  ~~  B  /\  B  ~~  ( A  u.  B ) )  -> 
( B  X.  A
)  ~~  ( A  u.  B ) )
3225, 30, 31syl2anc 643 . . . . 5  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( B  X.  A )  ~~  ( A  u.  B
) )
33 entr 7151 . . . . 5  |-  ( ( ( A  X.  B
)  ~~  ( B  X.  A )  /\  ( B  X.  A )  ~~  ( A  u.  B
) )  ->  ( A  X.  B )  ~~  ( A  u.  B
) )
3416, 32, 33syl2anc 643 . . . 4  |-  ( ( ( ( A  e. 
dom  card  /\  om  ~<_  A )  /\  ( B  e. 
dom  card  /\  B  =/=  (/) ) )  /\  A  ~<_  B )  ->  ( A  X.  B )  ~~  ( A  u.  B
) )
3534ex 424 . . 3  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( A  ~<_  B  ->  ( A  X.  B )  ~~  ( A  u.  B )
) )
3613, 35sylbird 227 . 2  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( -.  B  ~<  A  ->  ( A  X.  B )  ~~  ( A  u.  B )
) )
3711, 36pm2.61d 152 1  |-  ( ( ( A  e.  dom  card  /\  om  ~<_  A )  /\  ( B  e.  dom  card  /\  B  =/=  (/) ) )  ->  ( A  X.  B )  ~~  ( A  u.  B )
)
Colors of variables: wff set class
Syntax hints:   -. wn 3    -> wi 4    <-> wb 177    /\ wa 359    e. wcel 1725    =/= wne 2598    u. cun 3310   (/)c0 3620   class class class wbr 4204   omcom 4837    X. cxp 4868   dom cdm 4870    ~~ cen 7098    ~<_ cdom 7099    ~< csdm 7100   cardccrd 7814
This theorem is referenced by:  alephmul  8445
This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-3 7  ax-mp 8  ax-gen 1555  ax-5 1566  ax-17 1626  ax-9 1666  ax-8 1687  ax-13 1727  ax-14 1729  ax-6 1744  ax-7 1749  ax-11 1761  ax-12 1950  ax-ext 2416  ax-rep 4312  ax-sep 4322  ax-nul 4330  ax-pow 4369  ax-pr 4395  ax-un 4693  ax-inf2 7588
This theorem depends on definitions:  df-bi 178  df-or 360  df-an 361  df-3or 937  df-3an 938  df-tru 1328  df-ex 1551  df-nf 1554  df-sb 1659  df-eu 2284  df-mo 2285  df-clab 2422  df-cleq 2428  df-clel 2431  df-nfc 2560  df-ne 2600  df-ral 2702  df-rex 2703  df-reu 2704  df-rmo 2705  df-rab 2706  df-v 2950  df-sbc 3154  df-csb 3244  df-dif 3315  df-un 3317  df-in 3319  df-ss 3326  df-pss 3328  df-nul 3621  df-if 3732  df-pw 3793  df-sn 3812  df-pr 3813  df-tp 3814  df-op 3815  df-uni 4008  df-int 4043  df-iun 4087  df-br 4205  df-opab 4259  df-mpt 4260  df-tr 4295  df-eprel 4486  df-id 4490  df-po 4495  df-so 4496  df-fr 4533  df-se 4534  df-we 4535  df-ord 4576  df-on 4577  df-lim 4578  df-suc 4579  df-om 4838  df-xp 4876  df-rel 4877  df-cnv 4878  df-co 4879  df-dm 4880  df-rn 4881  df-res 4882  df-ima 4883  df-iota 5410  df-fun 5448  df-fn 5449  df-f 5450  df-f1 5451  df-fo 5452  df-f1o 5453  df-fv 5454  df-isom 5455  df-ov 6076  df-oprab 6077  df-mpt2 6078  df-1st 6341  df-2nd 6342  df-riota 6541  df-recs 6625  df-rdg 6660  df-1o 6716  df-2o 6717  df-oadd 6720  df-er 6897  df-en 7102  df-dom 7103  df-sdom 7104  df-fin 7105  df-oi 7471  df-card 7818  df-cda 8040
  Copyright terms: Public domain W3C validator