ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  axaddcl GIF version

Theorem axaddcl 8225
Description: Closure law for addition of complex numbers. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly, nor should the proven axiom ax-addcl 8269 be used later. Instead, in most cases use addcl 8298. (Contributed by NM, 14-Jun-1995.) (New usage is discouraged.)
Assertion
Ref Expression
axaddcl ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)

Proof of Theorem axaddcl
Dummy variables 𝑤 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elxpi 4788 . . . . 5 (𝐴 ∈ (R × R) → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)))
2 df-c 8179 . . . . 5 ℂ = (R × R)
31, 2eleq2s 2333 . . . 4 (𝐴 ∈ ℂ → ∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)))
4 elxpi 4788 . . . . 5 (𝐵 ∈ (R × R) → ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R)))
54, 2eleq2s 2333 . . . 4 (𝐵 ∈ ℂ → ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R)))
63, 5anim12i 338 . . 3 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
7 ee4anv 1994 . . 3 (∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) ↔ (∃𝑥𝑦(𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ ∃𝑧𝑤(𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
86, 7sylibr 134 . 2 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))))
9 simpll 531 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝐴 = ⟨𝑥, 𝑦⟩)
10 simprl 535 . . . . . . 7 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → 𝐵 = ⟨𝑧, 𝑤⟩)
119, 10oveq12d 6097 . . . . . 6 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 + 𝐵) = (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩))
12 addcnsr 8195 . . . . . . 7 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
1312ad2ant2l 512 . . . . . 6 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (⟨𝑥, 𝑦⟩ + ⟨𝑧, 𝑤⟩) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
1411, 13eqtrd 2271 . . . . 5 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 + 𝐵) = ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩)
15 addclsr 8114 . . . . . . . . 9 ((𝑥R𝑧R) → (𝑥 +R 𝑧) ∈ R)
1615ad2ant2r 513 . . . . . . . 8 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → (𝑥 +R 𝑧) ∈ R)
17 addclsr 8114 . . . . . . . . 9 ((𝑦R𝑤R) → (𝑦 +R 𝑤) ∈ R)
1817ad2ant2l 512 . . . . . . . 8 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → (𝑦 +R 𝑤) ∈ R)
19 opelxpi 4804 . . . . . . . 8 (((𝑥 +R 𝑧) ∈ R ∧ (𝑦 +R 𝑤) ∈ R) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ (R × R))
2016, 18, 19syl2anc 415 . . . . . . 7 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ (R × R))
2120, 2eleqtrrdi 2332 . . . . . 6 (((𝑥R𝑦R) ∧ (𝑧R𝑤R)) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ ℂ)
2221ad2ant2l 512 . . . . 5 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → ⟨(𝑥 +R 𝑧), (𝑦 +R 𝑤)⟩ ∈ ℂ)
2314, 22eqeltrd 2315 . . . 4 (((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 + 𝐵) ∈ ℂ)
2423exlimivv 1952 . . 3 (∃𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 + 𝐵) ∈ ℂ)
2524exlimivv 1952 . 2 (∃𝑥𝑦𝑧𝑤((𝐴 = ⟨𝑥, 𝑦⟩ ∧ (𝑥R𝑦R)) ∧ (𝐵 = ⟨𝑧, 𝑤⟩ ∧ (𝑧R𝑤R))) → (𝐴 + 𝐵) ∈ ℂ)
268, 25syl 14 1 ((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝐴 + 𝐵) ∈ ℂ)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1402  wex 1545  wcel 2209  cop 3711   × cxp 4770  (class class class)co 6079  Rcnr 7658   +R cplr 7662  cc 8171   + caddc 8176
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4244  ax-sep 4247  ax-nul 4257  ax-pow 4309  ax-pr 4344  ax-un 4576  ax-setind 4682  ax-iinf 4733
This theorem depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3714  df-pr 3715  df-op 3717  df-uni 3934  df-int 3969  df-iun 4012  df-br 4129  df-opab 4191  df-mpt 4192  df-tr 4228  df-eprel 4432  df-id 4436  df-po 4439  df-iso 4440  df-iord 4509  df-on 4511  df-suc 4514  df-iom 4736  df-xp 4778  df-rel 4779  df-cnv 4780  df-co 4781  df-dm 4782  df-rn 4783  df-res 4784  df-ima 4785  df-iota 5335  df-fun 5377  df-fn 5378  df-f 5379  df-f1 5380  df-fo 5381  df-f1o 5382  df-fv 5383  df-ov 6082  df-oprab 6083  df-mpo 6084  df-1st 6368  df-2nd 6369  df-recs 6570  df-irdg 6635  df-1o 6681  df-2o 6682  df-oadd 6685  df-omul 6686  df-er 6801  df-ec 6803  df-qs 6807  df-ni 7665  df-pli 7666  df-mi 7667  df-lti 7668  df-plpq 7705  df-mpq 7706  df-enq 7708  df-nqqs 7709  df-plqqs 7710  df-mqqs 7711  df-1nqqs 7712  df-rq 7713  df-ltnqqs 7714  df-enq0 7785  df-nq0 7786  df-0nq0 7787  df-plq0 7788  df-mq0 7789  df-inp 7827  df-iplp 7829  df-enr 8087  df-nr 8088  df-plr 8089  df-c 8179  df-add 8184
This theorem is referenced by:  axaddf  8229
  Copyright terms: Public domain W3C validator