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

Theorem infxp 9902
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 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐴 × 𝐵) ≈ (𝐴𝐵))

Proof of Theorem infxp
StepHypRef Expression
1 sdomdom 8723 . . 3 (𝐵𝐴𝐵𝐴)
2 infxpabs 9899 . . . . . 6 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵𝐴)) → (𝐴 × 𝐵) ≈ 𝐴)
3 infunabs 9894 . . . . . . . . 9 ((𝐴 ∈ dom card ∧ ω ≼ 𝐴𝐵𝐴) → (𝐴𝐵) ≈ 𝐴)
433expa 1116 . . . . . . . 8 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ 𝐵𝐴) → (𝐴𝐵) ≈ 𝐴)
54adantrl 712 . . . . . . 7 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵𝐴)) → (𝐴𝐵) ≈ 𝐴)
65ensymd 8746 . . . . . 6 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵𝐴)) → 𝐴 ≈ (𝐴𝐵))
7 entr 8747 . . . . . 6 (((𝐴 × 𝐵) ≈ 𝐴𝐴 ≈ (𝐴𝐵)) → (𝐴 × 𝐵) ≈ (𝐴𝐵))
82, 6, 7syl2anc 583 . . . . 5 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ≠ ∅ ∧ 𝐵𝐴)) → (𝐴 × 𝐵) ≈ (𝐴𝐵))
98expr 456 . . . 4 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ 𝐵 ≠ ∅) → (𝐵𝐴 → (𝐴 × 𝐵) ≈ (𝐴𝐵)))
109adantrl 712 . . 3 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐵𝐴 → (𝐴 × 𝐵) ≈ (𝐴𝐵)))
111, 10syl5 34 . 2 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐵𝐴 → (𝐴 × 𝐵) ≈ (𝐴𝐵)))
12 domtri2 9678 . . . 4 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
1312ad2ant2r 743 . . 3 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐴𝐵 ↔ ¬ 𝐵𝐴))
14 xpcomeng 8804 . . . . . 6 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
1514ad2ant2r 743 . . . . 5 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
16 simplrl 773 . . . . . . 7 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → 𝐵 ∈ dom card)
17 domtr 8748 . . . . . . . 8 ((ω ≼ 𝐴𝐴𝐵) → ω ≼ 𝐵)
1817ad4ant24 750 . . . . . . 7 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → ω ≼ 𝐵)
19 infn0 9006 . . . . . . . 8 (ω ≼ 𝐴𝐴 ≠ ∅)
2019ad3antlr 727 . . . . . . 7 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → 𝐴 ≠ ∅)
21 simpr 484 . . . . . . 7 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → 𝐴𝐵)
22 infxpabs 9899 . . . . . . 7 (((𝐵 ∈ dom card ∧ ω ≼ 𝐵) ∧ (𝐴 ≠ ∅ ∧ 𝐴𝐵)) → (𝐵 × 𝐴) ≈ 𝐵)
2316, 18, 20, 21, 22syl22anc 835 . . . . . 6 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → (𝐵 × 𝐴) ≈ 𝐵)
24 uncom 4083 . . . . . . . 8 (𝐴𝐵) = (𝐵𝐴)
25 infunabs 9894 . . . . . . . . 9 ((𝐵 ∈ dom card ∧ ω ≼ 𝐵𝐴𝐵) → (𝐵𝐴) ≈ 𝐵)
2616, 18, 21, 25syl3anc 1369 . . . . . . . 8 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → (𝐵𝐴) ≈ 𝐵)
2724, 26eqbrtrid 5105 . . . . . . 7 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → (𝐴𝐵) ≈ 𝐵)
2827ensymd 8746 . . . . . 6 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → 𝐵 ≈ (𝐴𝐵))
29 entr 8747 . . . . . 6 (((𝐵 × 𝐴) ≈ 𝐵𝐵 ≈ (𝐴𝐵)) → (𝐵 × 𝐴) ≈ (𝐴𝐵))
3023, 28, 29syl2anc 583 . . . . 5 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → (𝐵 × 𝐴) ≈ (𝐴𝐵))
31 entr 8747 . . . . 5 (((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ≈ (𝐴𝐵)) → (𝐴 × 𝐵) ≈ (𝐴𝐵))
3215, 30, 31syl2an2r 681 . . . 4 ((((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) ∧ 𝐴𝐵) → (𝐴 × 𝐵) ≈ (𝐴𝐵))
3332ex 412 . . 3 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐴𝐵 → (𝐴 × 𝐵) ≈ (𝐴𝐵)))
3413, 33sylbird 259 . 2 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (¬ 𝐵𝐴 → (𝐴 × 𝐵) ≈ (𝐴𝐵)))
3511, 34pm2.61d 179 1 (((𝐴 ∈ dom card ∧ ω ≼ 𝐴) ∧ (𝐵 ∈ dom card ∧ 𝐵 ≠ ∅)) → (𝐴 × 𝐵) ≈ (𝐴𝐵))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 205  wa 395  wcel 2108  wne 2942  cun 3881  c0 4253   class class class wbr 5070   × cxp 5578  dom cdm 5580  ωcom 7687  cen 8688  cdom 8689  csdm 8690  cardccrd 9624
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1799  ax-4 1813  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2110  ax-9 2118  ax-10 2139  ax-11 2156  ax-12 2173  ax-ext 2709  ax-rep 5205  ax-sep 5218  ax-nul 5225  ax-pow 5283  ax-pr 5347  ax-un 7566  ax-inf2 9329
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 844  df-3or 1086  df-3an 1087  df-tru 1542  df-fal 1552  df-ex 1784  df-nf 1788  df-sb 2069  df-mo 2540  df-eu 2569  df-clab 2716  df-cleq 2730  df-clel 2817  df-nfc 2888  df-ne 2943  df-ral 3068  df-rex 3069  df-reu 3070  df-rmo 3071  df-rab 3072  df-v 3424  df-sbc 3712  df-csb 3829  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-pss 3902  df-nul 4254  df-if 4457  df-pw 4532  df-sn 4559  df-pr 4561  df-tp 4563  df-op 4565  df-uni 4837  df-int 4877  df-iun 4923  df-br 5071  df-opab 5133  df-mpt 5154  df-tr 5188  df-id 5480  df-eprel 5486  df-po 5494  df-so 5495  df-fr 5535  df-se 5536  df-we 5537  df-xp 5586  df-rel 5587  df-cnv 5588  df-co 5589  df-dm 5590  df-rn 5591  df-res 5592  df-ima 5593  df-pred 6191  df-ord 6254  df-on 6255  df-lim 6256  df-suc 6257  df-iota 6376  df-fun 6420  df-fn 6421  df-f 6422  df-f1 6423  df-fo 6424  df-f1o 6425  df-fv 6426  df-isom 6427  df-riota 7212  df-ov 7258  df-om 7688  df-1st 7804  df-2nd 7805  df-frecs 8068  df-wrecs 8099  df-recs 8173  df-rdg 8212  df-1o 8267  df-2o 8268  df-er 8456  df-en 8692  df-dom 8693  df-sdom 8694  df-fin 8695  df-oi 9199  df-dju 9590  df-card 9628
This theorem is referenced by:  alephmul  10265
  Copyright terms: Public domain W3C validator