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

Theorem omxpen 9051
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) → (𝐴 ·o 𝐵) ≈ (𝐴 × 𝐵))

Proof of Theorem omxpen
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 xpcomeng 9041 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
2 xpexg 7733 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 × 𝐴) ∈ V)
32ancoms 462 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ∈ V)
4 omcl 8505 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ∈ On)
5 eqid 2762 . . . . 5 (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
65omxpenlem 9050 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵))
7 f1oen2g 8949 . . . 4 (((𝐵 × 𝐴) ∈ V ∧ (𝐴 ·o 𝐵) ∈ On ∧ (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵)) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
83, 4, 6, 7syl3anc 1390 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
9 entr 8987 . . 3 (((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵)) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
101, 8, 9syl2anc 593 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
1110ensymd 8986 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ≈ (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 399  wcel 2142  Vcvv 3454   class class class wbr 5100   × cxp 5645  Oncon0 6346  1-1-ontowf1o 6520  (class class class)co 7396  cmpo 7398   +o coa 8434   ·o comu 8435  cen 8924
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718
This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3or 1099  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-pss 3924  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4906  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5542  df-eprel 5547  df-po 5555  df-so 5556  df-fr 5600  df-we 5602  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-pred 6288  df-ord 6349  df-on 6350  df-lim 6351  df-suc 6352  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-ov 7399  df-oprab 7400  df-mpo 7401  df-om 7847  df-1st 7970  df-2nd 7971  df-frecs 8262  df-wrecs 8293  df-recs 8342  df-rdg 8381  df-1o 8437  df-oadd 8441  df-omul 8442  df-er 8678  df-en 8928
This theorem is referenced by:  xpnum  9909  infxpenc2  9978
  Copyright terms: Public domain W3C validator