Theorem xpnum 9942

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 9936	. 2 ⊢ (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
2		isnum2 9936	. 2 ⊢ (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦 ≈ 𝐵)
3		reeanv 3226	. . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵))
4		omcl 8532	. . . . . 6 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5		omxpen 9070	. . . . . . 7 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6		xpen 9136	. . . . . . 7 ⊢ ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7		entr 8998	. . . . . . 7 ⊢ (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
8	5, 6, 7	syl2an 596	. . . . . 6 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9		isnumi 9937	. . . . . 6 ⊢ (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
10	4, 8, 9	syl2an2r 683	. . . . 5 ⊢ (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
11	10	ex 413	. . . 4 ⊢ ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card))
12	11	rexlimivv 3199	. . 3 ⊢ (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
13	3, 12	sylbir 234	. 2 ⊢ ((∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
14	1, 2, 13	syl2anb 598	1 ⊢ ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)

Syntax hints:   → wi 4   ∧ wa 396   ∈ wcel 2106  ∃wrex 3070   class class class wbr 5147   × cxp 5673  dom cdm 5675  Oncon0 6361  (class class class)co 7405   ·_o comu 8460   ≈ cen 8932  cardccrd 9926

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-10 2137  ax-11 2154  ax-12 2171  ax-ext 2703  ax-rep 5284  ax-sep 5298  ax-nul 5305  ax-pow 5362  ax-pr 5426  ax-un 7721

This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-3or 1088  df-3an 1089  df-tru 1544  df-fal 1554  df-ex 1782  df-nf 1786  df-sb 2068  df-mo 2534  df-eu 2563  df-clab 2710  df-cleq 2724  df-clel 2810  df-nfc 2885  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3376  df-reu 3377  df-rab 3433  df-v 3476  df-sbc 3777  df-csb 3893  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-pss 3966  df-nul 4322  df-if 4528  df-pw 4603  df-sn 4628  df-pr 4630  df-op 4634  df-uni 4908  df-int 4950  df-iun 4998  df-br 5148  df-opab 5210  df-mpt 5231  df-tr 5265  df-id 5573  df-eprel 5579  df-po 5587  df-so 5588  df-fr 5630  df-we 5632  df-xp 5681  df-rel 5682  df-cnv 5683  df-co 5684  df-dm 5685  df-rn 5686  df-res 5687  df-ima 5688  df-pred 6297  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6492  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-ov 7408  df-oprab 7409  df-mpo 7410  df-om 7852  df-1st 7971  df-2nd 7972  df-frecs 8262  df-wrecs 8293  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-omul 8467  df-er 8699  df-en 8936  df-dom 8937  df-card 9930

This theorem is referenced by:  iunfictbso  10105  znnen  16151  qnnen  16152  ptcmplem2  23548  finixpnum  36461  poimirlem32  36508  isnumbasgrplem2  41831