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

Theorem axaddrcl 8176
Description: Closure law for addition in the real subfield 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-addrcl 8220 be used later. Instead, in most cases use readdcl 8249. (Contributed by NM, 31-Mar-1996.) (New usage is discouraged.)
Assertion
Ref Expression
axaddrcl ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ)

Proof of Theorem axaddrcl
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elreal 8139 . 2 (𝐴 ∈ ℝ ↔ ∃𝑥R𝑥, 0R⟩ = 𝐴)
2 elreal 8139 . 2 (𝐵 ∈ ℝ ↔ ∃𝑦R𝑦, 0R⟩ = 𝐵)
3 oveq1 6056 . . 3 (⟨𝑥, 0R⟩ = 𝐴 → (⟨𝑥, 0R⟩ + ⟨𝑦, 0R⟩) = (𝐴 + ⟨𝑦, 0R⟩))
43eleq1d 2301 . 2 (⟨𝑥, 0R⟩ = 𝐴 → ((⟨𝑥, 0R⟩ + ⟨𝑦, 0R⟩) ∈ ℝ ↔ (𝐴 + ⟨𝑦, 0R⟩) ∈ ℝ))
5 oveq2 6057 . . 3 (⟨𝑦, 0R⟩ = 𝐵 → (𝐴 + ⟨𝑦, 0R⟩) = (𝐴 + 𝐵))
65eleq1d 2301 . 2 (⟨𝑦, 0R⟩ = 𝐵 → ((𝐴 + ⟨𝑦, 0R⟩) ∈ ℝ ↔ (𝐴 + 𝐵) ∈ ℝ))
7 addresr 8148 . . 3 ((𝑥R𝑦R) → (⟨𝑥, 0R⟩ + ⟨𝑦, 0R⟩) = ⟨(𝑥 +R 𝑦), 0R⟩)
8 addclsr 8064 . . . 4 ((𝑥R𝑦R) → (𝑥 +R 𝑦) ∈ R)
9 opelreal 8138 . . . 4 (⟨(𝑥 +R 𝑦), 0R⟩ ∈ ℝ ↔ (𝑥 +R 𝑦) ∈ R)
108, 9sylibr 134 . . 3 ((𝑥R𝑦R) → ⟨(𝑥 +R 𝑦), 0R⟩ ∈ ℝ)
117, 10eqeltrd 2309 . 2 ((𝑥R𝑦R) → (⟨𝑥, 0R⟩ + ⟨𝑦, 0R⟩) ∈ ℝ)
121, 2, 4, 6, 112gencl 2846 1 ((𝐴 ∈ ℝ ∧ 𝐵 ∈ ℝ) → (𝐴 + 𝐵) ∈ ℝ)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104   = wceq 1398  wcel 2203  cop 3691  (class class class)co 6049  Rcnr 7608  0Rc0r 7609   +R cplr 7612  cr 8122   + caddc 8126
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 619  ax-in2 620  ax-io 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-2o 6647  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7615  df-pli 7616  df-mi 7617  df-lti 7618  df-plpq 7655  df-mpq 7656  df-enq 7658  df-nqqs 7659  df-plqqs 7660  df-mqqs 7661  df-1nqqs 7662  df-rq 7663  df-ltnqqs 7664  df-enq0 7735  df-nq0 7736  df-0nq0 7737  df-plq0 7738  df-mq0 7739  df-inp 7777  df-i1p 7778  df-iplp 7779  df-enr 8037  df-nr 8038  df-plr 8039  df-0r 8042  df-c 8129  df-r 8133  df-add 8134
This theorem is referenced by:  peano5nnnn  8203
  Copyright terms: Public domain W3C validator