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

Theorem xpnum 9937
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 9931 . 2 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
2 isnum2 9931 . 2 (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦𝐵)
3 reeanv 3243 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥𝐴𝑦𝐵) ↔ (∃𝑥 ∈ On 𝑥𝐴 ∧ ∃𝑦 ∈ On 𝑦𝐵))
4 omcl 8521 . . . . . 6 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5 omxpen 9067 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6 xpen 9128 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7 entr 9003 . . . . . . 7 (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
85, 6, 7syl2an 607 . . . . . 6 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥𝐴𝑦𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9 isnumi 9932 . . . . . 6 (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
104, 8, 9syl2an2r 697 . . . . 5 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥𝐴𝑦𝐵)) → (𝐴 × 𝐵) ∈ dom card)
1110ex 417 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥𝐴𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card))
1211rexlimivv 3213 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥𝐴𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card)
133, 12sylbir 238 . 2 ((∃𝑥 ∈ On 𝑥𝐴 ∧ ∃𝑦 ∈ On 𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card)
141, 2, 13syl2anb 609 1 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  wcel 2149  wrex 3095   class class class wbr 5113   × cxp 5660  dom cdm 5662  Oncon0 6361  (class class class)co 7411   ·o comu 8451  cen 8940  cardccrd 9921
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-10 2182  ax-11 2198  ax-12 2219  ax-ext 2741  ax-rep 5242  ax-sep 5261  ax-nul 5271  ax-pow 5337  ax-pr 5405  ax-un 7733
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-nf 1811  df-sb 2098  df-mo 2573  df-eu 2603  df-clab 2748  df-cleq 2761  df-clel 2844  df-nfc 2918  df-ne 2965  df-ral 3086  df-rex 3096  df-rmo 3376  df-reu 3377  df-rab 3424  df-v 3465  df-sbc 3754  df-csb 3862  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-pss 3933  df-nul 4295  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4877  df-int 4917  df-iun 4962  df-br 5114  df-opab 5178  df-mpt 5197  df-tr 5223  df-id 5557  df-eprel 5562  df-po 5570  df-so 5571  df-fr 5615  df-we 5617  df-xp 5668  df-rel 5669  df-cnv 5670  df-co 5671  df-dm 5672  df-rn 5673  df-res 5674  df-ima 5675  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7414  df-oprab 7415  df-mpo 7416  df-om 7863  df-1st 7986  df-2nd 7987  df-frecs 8278  df-wrecs 8309  df-recs 8358  df-rdg 8397  df-1o 8453  df-oadd 8457  df-omul 8458  df-er 8694  df-en 8944  df-dom 8945  df-card 9925
This theorem is referenced by:  iunfictbso  10098  znnen  16268  qnnen  16269  ptcmplem2  24179  finixpnum  38144  poimirlem32  38191  isnumbasgrplem2  43723
  Copyright terms: Public domain W3C validator