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

Theorem omxpen 8062
Description: The cardinal and ordinal products are always equinumerous. Exercise 10 of [TakeutiZaring] p. 89. (Contributed by Mario Carneiro, 3-Mar-2013.)
Assertion
Ref Expression
omxpen ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·𝑜 𝐵) ≈ (𝐴 × 𝐵))

Proof of Theorem omxpen
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpcomeng 8052 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
2 xpexg 6960 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 × 𝐴) ∈ V)
32ancoms 469 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ∈ V)
4 omcl 7616 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·𝑜 𝐵) ∈ On)
5 eqid 2622 . . . . 5 (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·𝑜 𝑥) +𝑜 𝑦)) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·𝑜 𝑥) +𝑜 𝑦))
65omxpenlem 8061 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·𝑜 𝑥) +𝑜 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·𝑜 𝐵))
7 f1oen2g 7972 . . . 4 (((𝐵 × 𝐴) ∈ V ∧ (𝐴 ·𝑜 𝐵) ∈ On ∧ (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·𝑜 𝑥) +𝑜 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·𝑜 𝐵)) → (𝐵 × 𝐴) ≈ (𝐴 ·𝑜 𝐵))
83, 4, 6, 7syl3anc 1326 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ≈ (𝐴 ·𝑜 𝐵))
9 entr 8008 . . 3 (((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ≈ (𝐴 ·𝑜 𝐵)) → (𝐴 × 𝐵) ≈ (𝐴 ·𝑜 𝐵))
101, 8, 9syl2anc 693 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐴 ·𝑜 𝐵))
1110ensymd 8007 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·𝑜 𝐵) ≈ (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  wcel 1990  Vcvv 3200   class class class wbr 4653   × cxp 5112  Oncon0 5723  1-1-ontowf1o 5887  (class class class)co 6650  cmpt2 6652   +𝑜 coa 7557   ·𝑜 comu 7558  cen 7952
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-rep 4771  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1038  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-reu 2919  df-rmo 2920  df-rab 2921  df-v 3202  df-sbc 3436  df-csb 3534  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-pss 3590  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-tp 4182  df-op 4184  df-uni 4437  df-int 4476  df-iun 4522  df-br 4654  df-opab 4713  df-mpt 4730  df-tr 4753  df-id 5024  df-eprel 5029  df-po 5035  df-so 5036  df-fr 5073  df-we 5075  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-pred 5680  df-ord 5726  df-on 5727  df-lim 5728  df-suc 5729  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-f1 5893  df-fo 5894  df-f1o 5895  df-fv 5896  df-ov 6653  df-oprab 6654  df-mpt2 6655  df-om 7066  df-1st 7168  df-2nd 7169  df-wrecs 7407  df-recs 7468  df-rdg 7506  df-1o 7560  df-oadd 7564  df-omul 7565  df-er 7742  df-en 7956
This theorem is referenced by:  xpnum  8777  infxpenc2  8845
  Copyright terms: Public domain W3C validator