Theorem omxpen 9136

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.

Step	Hyp	Ref	Expression
1		xpcomeng 9126	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐵 × 𝐴))
2		xpexg 7796	. . . . 5 ⊢ ((𝐵 ∈ On ∧ 𝐴 ∈ On) → (𝐵 × 𝐴) ∈ V)
3	2	ancoms 464	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ∈ V)
4		omcl 8582	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ∈ On)
5		eqid 2763	. . . . 5 ⊢ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)) = (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦))
6	5	omxpenlem 9135	. . . 4 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)⟶1-1onto(𝐴 ·o 𝐵))
7		f1oen2g 9033	. . . 4 ⊢ (((𝐵 × 𝐴) ∈ V ∧ (𝐴 ·o 𝐵) ∈ On ∧ (𝑥 ∈ 𝐵, 𝑦 ∈ 𝐴 ↦ ((𝐴 ·o 𝑥) +o 𝑦)):(𝐵 × 𝐴)⟶1-1onto(𝐴 ·o 𝐵)) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
8	3, 4, 6, 7	syl3anc 1399	. . 3 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵))
9		entr 9071	. . 3 ⊢ (((𝐴 × 𝐵) ≈ (𝐵 × 𝐴) ∧ (𝐵 × 𝐴) ≈ (𝐴 ·o 𝐵)) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
10	1, 8, 9	syl2anc 596	. 2 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 × 𝐵) ≈ (𝐴 ·o 𝐵))
11	10	ensymd 9070	1 ⊢ ((𝐴 ∈ On ∧ 𝐵 ∈ On) → (𝐴 ·o 𝐵) ≈ (𝐴 × 𝐵))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2147  Vcvv 3454   class class class wbr 5108   × cxp 5656  Oncon0 6388  ⟶1-1ontowf1o 6565  (class class class)co 7451   ∈ cmpo 7453   +_o coa 8511   ·_o comu 8512   ≈ cen 9008

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5238  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-int 4913  df-iun 4958  df-br 5109  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5553  df-eprel 5558  df-po 5566  df-so 5567  df-fr 5611  df-we 5613  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-pred 6330  df-ord 6391  df-on 6392  df-lim 6393  df-suc 6394  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-f1 6571  df-fo 6572  df-f1o 6573  df-fv 6574  df-ov 7454  df-oprab 7455  df-mpo 7456  df-om 7912  df-1st 8035  df-2nd 8036  df-frecs 8337  df-wrecs 8368  df-recs 8417  df-rdg 8456  df-1o 8514  df-oadd 8518  df-omul 8519  df-er 8755  df-en 9012

This theorem is used by:  xpnum  10069  infxpenc2  10140  jltalephlem  36066  hashnnm  46275