Theorem infxpidm2 10013

Description: Every infinite well-orderable set is equinumerous to its Cartesian square. This theorem provides the basis for infinite cardinal arithmetic. Proposition 10.40 of [TakeutiZaring] p. 95. See also infxpidm 10557. (Contributed by Mario Carneiro, 9-Mar-2013.) (Revised by Mario Carneiro, 29-Apr-2015.)

Assertion

Ref	Expression
infxpidm2	⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 × 𝐴) ≈ 𝐴)

Proof of Theorem infxpidm2

Step	Hyp	Ref	Expression
1		cardid2 9951	. . . . . 6 ⊢ (𝐴 ∈ dom card → (card‘𝐴) ≈ 𝐴)
2	1	ensymd 9004	. . . . 5 ⊢ (𝐴 ∈ dom card → 𝐴 ≈ (card‘𝐴))
3		xpen 9131	. . . . 5 ⊢ ((𝐴 ≈ (card‘𝐴) ∧ 𝐴 ≈ (card‘𝐴)) → (𝐴 × 𝐴) ≈ ((card‘𝐴) × (card‘𝐴)))
4	2, 2, 3	syl2anc 596	. . . 4 ⊢ (𝐴 ∈ dom card → (𝐴 × 𝐴) ≈ ((card‘𝐴) × (card‘𝐴)))
5	4	adantr 486	. . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 × 𝐴) ≈ ((card‘𝐴) × (card‘𝐴)))
6		cardon 9942	. . . 4 ⊢ (card‘𝐴) ∈ On
7		cardom 9984	. . . . 5 ⊢ (card‘ω) = ω
8		omelon 9618	. . . . . . . 8 ⊢ ω ∈ On
9		onenon 9947	. . . . . . . 8 ⊢ (ω ∈ On → ω ∈ dom card)
10	8, 9	ax-mp 5	. . . . . . 7 ⊢ ω ∈ dom card
11		carddom2 9975	. . . . . . 7 ⊢ ((ω ∈ dom card ∧ 𝐴 ∈ dom card) → ((card‘ω) ⊆ (card‘𝐴) ↔ ω ≼ 𝐴))
12	10, 11	mpan 703	. . . . . 6 ⊢ (𝐴 ∈ dom card → ((card‘ω) ⊆ (card‘𝐴) ↔ ω ≼ 𝐴))
13	12	biimpar 483	. . . . 5 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (card‘ω) ⊆ (card‘𝐴))
14	7, 13	eqsstrrid 3977	. . . 4 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → ω ⊆ (card‘𝐴))
15		infxpen 10010	. . . 4 ⊢ (((card‘𝐴) ∈ On ∧ ω ⊆ (card‘𝐴)) → ((card‘𝐴) × (card‘𝐴)) ≈ (card‘𝐴))
16	6, 14, 15	sylancr 599	. . 3 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → ((card‘𝐴) × (card‘𝐴)) ≈ (card‘𝐴))
17		entr 9005	. . 3 ⊢ (((𝐴 × 𝐴) ≈ ((card‘𝐴) × (card‘𝐴)) ∧ ((card‘𝐴) × (card‘𝐴)) ≈ (card‘𝐴)) → (𝐴 × 𝐴) ≈ (card‘𝐴))
18	5, 16, 17	syl2anc 596	. 2 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 × 𝐴) ≈ (card‘𝐴))
19	1	adantr 486	. 2 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (card‘𝐴) ≈ 𝐴)
20		entr 9005	. 2 ⊢ (((𝐴 × 𝐴) ≈ (card‘𝐴) ∧ (card‘𝐴) ≈ 𝐴) → (𝐴 × 𝐴) ≈ 𝐴)
21	18, 19, 20	syl2anc 596	1 ⊢ ((𝐴 ∈ dom card ∧ ω ≼ 𝐴) → (𝐴 × 𝐴) ≈ 𝐴)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∈ wcel 2146   ⊆ wss 3906   class class class wbr 5111   × cxp 5661  dom cdm 5663  Oncon0 6364  ‘cfv 6540  ωcom 7864   ≈ cen 8942   ≼ cdom 8943  cardccrd 9933

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7738  ax-inf2 9613

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 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-se 5617  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-isom 6549  df-riota 7373  df-ov 7419  df-om 7865  df-1st 7988  df-2nd 7989  df-frecs 8280  df-wrecs 8311  df-recs 8360  df-rdg 8399  df-1o 8455  df-er 8696  df-en 8946  df-dom 8947  df-sdom 8948  df-fin 8949  df-oi 9475  df-card 9937

This theorem is used by:  infpwfien  10058  mappwen  10108  infdjuabs  10200  infxpdom  10205  fin67  10390  infxpidm  10557  ttac  43796