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

Theorem omxpen 9063
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 9053 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
2 xpexg 7745 . . . . 5 ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 × 𝐴) ∈ V)
32ancoms 463 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ∈ V)
4 omcl 8517 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ∈ On)
5 eqid 2763 . . . . 5 (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) = (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
65omxpenlem 9062 . . . 4 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵))
7 f1oen2g 8961 . . . 4 (((𝐵 × 𝐴) ∈ V ∧ (𝐴 ·o 𝐵) ∈ On ∧ (𝑥𝐵, 𝑦𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)–1-1-onto→(𝐴 ·o 𝐵)) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
83, 4, 6, 7syl3anc 1398 . . 3 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
9 entr 8999 . . 3 (((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵)) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
101, 8, 9syl2anc 595 . 2 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
1110ensymd 8998 1 ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ≈ (𝐴 × 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wcel 2143  Vcvv 3455   class class class wbr 5109   × cxp 5659  Oncon0 6360  1-1-ontowf1o 6535  (class class class)co 7410  cmpo 7412   +o coa 8446   ·o comu 8447  cen 8936
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-1st 7982  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-1o 8449  df-oadd 8453  df-omul 8454  df-er 8690  df-en 8940
This theorem is referenced by:  xpnum  9933  infxpenc2  10002  hashnnm  45730
  Copyright terms: Public domain W3C validator