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

Theorem xpnum 10032
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 10026 . 2 (𝐴 ∈ dom card ↔ ∃𝑥 ∈ On 𝑥 ≈ 𝐴)
2 isnum2 10026 . 2 (𝐵 ∈ dom card ↔ ∃𝑦 ∈ On 𝑦 ≈ 𝐵)
3 reeanv 3235 . . 3 (∃𝑥 ∈ On ∃𝑦 ∈ On (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) ↔ (∃𝑥 ∈ On 𝑥 ≈ 𝐴 ∧ ∃𝑦 ∈ On 𝑦 ≈ 𝐵))
4 omcl 8544 . . . . . 6 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ∈ On)
5 omxpen 9098 . . . . . . 7 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → (𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦))
6 xpen 9159 . . . . . . 7 ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝑥 × 𝑦) ≈ (𝐴 × 𝐵))
7 entr 9033 . . . . . . 7 (((𝑥 ·o 𝑦) ≈ (𝑥 × 𝑦) ∧ (𝑥 × 𝑦) ≈ (𝐴 × 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
85, 6, 7syl2an 608 . . . . . 6 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵))
9 isnumi 10027 . . . . . 6 (((𝑥 ·o 𝑦) ∈ On ∧ (𝑥 ·o 𝑦) ≈ (𝐴 × 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
104, 8, 9syl2an2r 698 . . . . 5 (((𝑥 ∈ On ∧ 𝑦 ∈ On) ∧ (𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵)) → (𝐴 × 𝐵) ∈ dom card)
1110ex 418 . . . 4 ((𝑥 ∈ On ∧ 𝑦 ∈ On) → ((𝑥 ≈ 𝐴 ∧ 𝑦 ≈ 𝐵) → (𝐴 × 𝐵) ∈ dom card))
1211rexlimivv 3205 . . 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 2145  ∃wrex 3087   class class class wbr 5103   × cxp 5649  dom cdm 5651  Oncon0 6362  (class class class)co 7420   ·o comu 8474   ≈ cen 8970  cardccrd 10016
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7751
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-pss 3919  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-int 4908  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-tr 5213  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 6304  df-ord 6365  df-on 6366  df-lim 6367  df-suc 6368  df-iota 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-ov 7423  df-oprab 7424  df-mpo 7425  df-om 7878  df-1st 8001  df-2nd 8002  df-frecs 8299  df-wrecs 8330  df-recs 8379  df-rdg 8418  df-1o 8476  df-oadd 8480  df-omul 8481  df-er 8717  df-en 8974  df-dom 8975  df-card 10020
This theorem is used by:  iunfictbso  10193  znnen  16380  qnnen  16381  ptcmplem2  24372  finixpnum  38528  poimirlem32  38570  isnumbasgrplem2  44105  smflimlem6  47785
  Copyright terms: Public domain W3C validator