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

Theorem xpnum 10039
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.
StepHypRef Expression
1 isnum2 10033 . 2 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
2 isnum2 10033 . 2 (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦 ≈ 𝐵)
3 reeanv 3234 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵))
4 omcl 8552 . . . . . 6 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5 omxpen 9106 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6 xpen 9167 . . . . . . 7 ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7 entr 9041 . . . . . . 7 (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
85, 6, 7syl2an 608 . . . . . 6 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9 isnumi 10034 . . . . . 6 (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
104, 8, 9syl2an2r 698 . . . . 5 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
1110ex 418 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card))
1211rexlimivv 3204 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
133, 12sylbir 238 . 2 ((∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card)
141, 2, 13syl2anb 610 1 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∈ wcel 2144  ∃wrex 3086   class class class wbr 5102   × cxp 5649  dom cdm 5651  Oncon0 6365  (class class class)co 7424   ·o comu 8482   ≈ cen 8978  cardccrd 10023
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5327  ax-pr 5391  ax-un 7755
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3848  df-ss 3897  df-pss 4013  df-dif 4046  df-in 4090  df-un 4150  df-nul 4278  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-int 4907  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-we 5606  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-pred 6307  df-ord 6368  df-on 6369  df-lim 6370  df-suc 6371  df-iota 6497  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7427  df-oprab 7428  df-mpo 7429  df-om 7882  df-1st 8005  df-2nd 8006  df-frecs 8307  df-wrecs 8338  df-recs 8387  df-rdg 8426  df-1o 8484  df-oadd 8488  df-omul 8489  df-er 8725  df-en 8982  df-dom 8983  df-card 10027
This theorem is used by:  iunfictbso  10200  znnen  16389  qnnen  16390  ptcmplem2  24381  finixpnum  38665  poimirlem32  38707  isnumbasgrplem2  44243  smflimlem6  47922
  Copyright terms: Public domain W3C validator