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

Theorem xpnum 9382
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 9376 . 2 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥𝐴)
2 isnum2 9376 . 2 (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦𝐵)
3 reeanv 3369 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥𝐴𝑦𝐵) ↔ (∃𝑥 ∈ On 𝑥𝐴 ∧ ∃𝑦 ∈ On 𝑦𝐵))
4 omcl 8163 . . . . . 6 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5 omxpen 8621 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6 xpen 8682 . . . . . . 7 ((𝑥𝐴𝑦𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7 entr 8563 . . . . . . 7 (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
85, 6, 7syl2an 597 . . . . . 6 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥𝐴𝑦𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9 isnumi 9377 . . . . . 6 (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
104, 8, 9syl2an2r 683 . . . . 5 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥𝐴𝑦𝐵)) → (𝐴 × 𝐵) ∈ dom card)
1110ex 415 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥𝐴𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card))
1211rexlimivv 3294 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥𝐴𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card)
133, 12sylbir 237 . 2 ((∃𝑥 ∈ On 𝑥𝐴 ∧ ∃𝑦 ∈ On 𝑦𝐵) → (𝐴 × 𝐵) ∈ dom card)
141, 2, 13syl2anb 599 1 ((𝐴 ∈ dom card ∧ 𝐵 ∈ dom card) → (𝐴 × 𝐵) ∈ dom card)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398  wcel 2114  wrex 3141   class class class wbr 5068   × cxp 5555  dom cdm 5557  Oncon0 6193  (class class class)co 7158   ·o comu 8102  cen 8508  cardccrd 9366
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-rep 5192  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ne 3019  df-ral 3145  df-rex 3146  df-reu 3147  df-rmo 3148  df-rab 3149  df-v 3498  df-sbc 3775  df-csb 3886  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-pss 3956  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-tp 4574  df-op 4576  df-uni 4841  df-int 4879  df-iun 4923  df-br 5069  df-opab 5131  df-mpt 5149  df-tr 5175  df-id 5462  df-eprel 5467  df-po 5476  df-so 5477  df-fr 5516  df-we 5518  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-res 5569  df-ima 5570  df-pred 6150  df-ord 6196  df-on 6197  df-lim 6198  df-suc 6199  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-f1 6362  df-fo 6363  df-f1o 6364  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-om 7583  df-1st 7691  df-2nd 7692  df-wrecs 7949  df-recs 8010  df-rdg 8048  df-1o 8104  df-oadd 8108  df-omul 8109  df-er 8291  df-en 8512  df-dom 8513  df-card 9370
This theorem is referenced by:  iunfictbso  9542  znnen  15567  qnnen  15568  ptcmplem2  22663  finixpnum  34879  poimirlem32  34926  isnumbasgrplem2  39711
  Copyright terms: Public domain W3C validator