Theorem xpnum 9904

Description: The cartesian product of numerable sets is numerable. (Contributed by Mario Carneiro, 3-Mar-2013.) (Revised by Mario Carneiro, 29-Apr-2015.)

Assertion

Ref	Expression
xpnum	⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)

Proof of Theorem xpnum

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isnum2 9898	. 2 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
2		isnum2 9898	. 2 ⊢ (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦 ≈ 𝐵)
3		reeanv 3209	. . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵))
4		omcl 8500	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5		omxpen 9043	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6		xpen 9104	. . . . . . 7 ⊢ ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7		entr 8977	. . . . . . 7 ⊢ (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
8	5, 6, 7	syl2an 596	. . . . . 6 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9		isnumi 9899	. . . . . 6 ⊢ (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
10	4, 8, 9	syl2an2r 685	. . . . 5 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
11	10	ex 412	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card))
12	11	rexlimivv 3179	. . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
13	3, 12	sylbir 235	. 2 ⊢ ((∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
14	1, 2, 13	syl2anb 598	1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)

Syntax hints:   → wi 4   ∧ wa 395   ∈ wcel 2109  ∃wrex 3053   class class class wbr 5107   × cxp 5636  dom cdm 5638  Oncon0 6332  (class class class)co 7387   ·_o comu 8432   ≈ cen 8915  cardccrd 9888

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2701  ax-rep 5234  ax-sep 5251  ax-nul 5261  ax-pow 5320  ax-pr 5387  ax-un 7711

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rmo 3354  df-reu 3355  df-rab 3406  df-v 3449  df-sbc 3754  df-csb 3863  df-dif 3917  df-un 3919  df-in 3921  df-ss 3931  df-pss 3934  df-nul 4297  df-if 4489  df-pw 4565  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4872  df-int 4911  df-iun 4957  df-br 5108  df-opab 5170  df-mpt 5189  df-tr 5215  df-id 5533  df-eprel 5538  df-po 5546  df-so 5547  df-fr 5591  df-we 5593  df-xp 5644  df-rel 5645  df-cnv 5646  df-co 5647  df-dm 5648  df-rn 5649  df-res 5650  df-ima 5651  df-pred 6274  df-ord 6335  df-on 6336  df-lim 6337  df-suc 6338  df-iota 6464  df-fun 6513  df-fn 6514  df-f 6515  df-f1 6516  df-fo 6517  df-f1o 6518  df-fv 6519  df-ov 7390  df-oprab 7391  df-mpo 7392  df-om 7843  df-1st 7968  df-2nd 7969  df-frecs 8260  df-wrecs 8291  df-recs 8340  df-rdg 8378  df-1o 8434  df-oadd 8438  df-omul 8439  df-er 8671  df-en 8919  df-dom 8920  df-card 9892

This theorem is referenced by:  iunfictbso  10067  znnen  16180  qnnen  16181  ptcmplem2  23940  finixpnum  37599  poimirlem32  37646  isnumbasgrplem2  43093