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

Theorem axrnegex 8240
Description: Existence of negative of real number. Axiom for real and complex numbers, derived from set theory. This construction-dependent theorem should not be referenced directly; instead, use ax-rnegex 8282. (Contributed by NM, 15-May-1996.) (New usage is discouraged.)
Assertion
Ref Expression
axrnegex (𝐴 ∈ ℝ → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
Distinct variable group:   𝑥,𝐴

Proof of Theorem axrnegex
StepHypRef Expression
1 elreal2 8191 . . . . 5 (𝐴 ∈ ℝ ↔ ((1st𝐴) ∈ R𝐴 = ⟨(1st𝐴), 0R⟩))
21simplbi 274 . . . 4 (𝐴 ∈ ℝ → (1st𝐴) ∈ R)
3 m1r 8113 . . . 4 -1RR
4 mulclsr 8115 . . . 4 (((1st𝐴) ∈ R ∧ -1RR) → ((1st𝐴) ·R -1R) ∈ R)
52, 3, 4sylancl 417 . . 3 (𝐴 ∈ ℝ → ((1st𝐴) ·R -1R) ∈ R)
6 opelreal 8188 . . 3 (⟨((1st𝐴) ·R -1R), 0R⟩ ∈ ℝ ↔ ((1st𝐴) ·R -1R) ∈ R)
75, 6sylibr 134 . 2 (𝐴 ∈ ℝ → ⟨((1st𝐴) ·R -1R), 0R⟩ ∈ ℝ)
81simprbi 275 . . . 4 (𝐴 ∈ ℝ → 𝐴 = ⟨(1st𝐴), 0R⟩)
98oveq1d 6094 . . 3 (𝐴 ∈ ℝ → (𝐴 + ⟨((1st𝐴) ·R -1R), 0R⟩) = (⟨(1st𝐴), 0R⟩ + ⟨((1st𝐴) ·R -1R), 0R⟩))
10 addresr 8198 . . . 4 (((1st𝐴) ∈ R ∧ ((1st𝐴) ·R -1R) ∈ R) → (⟨(1st𝐴), 0R⟩ + ⟨((1st𝐴) ·R -1R), 0R⟩) = ⟨((1st𝐴) +R ((1st𝐴) ·R -1R)), 0R⟩)
112, 5, 10syl2anc 415 . . 3 (𝐴 ∈ ℝ → (⟨(1st𝐴), 0R⟩ + ⟨((1st𝐴) ·R -1R), 0R⟩) = ⟨((1st𝐴) +R ((1st𝐴) ·R -1R)), 0R⟩)
12 pn0sr 8132 . . . . . 6 ((1st𝐴) ∈ R → ((1st𝐴) +R ((1st𝐴) ·R -1R)) = 0R)
1312opeq1d 3908 . . . . 5 ((1st𝐴) ∈ R → ⟨((1st𝐴) +R ((1st𝐴) ·R -1R)), 0R⟩ = ⟨0R, 0R⟩)
14 df-0 8180 . . . . 5 0 = ⟨0R, 0R
1513, 14eqtr4di 2289 . . . 4 ((1st𝐴) ∈ R → ⟨((1st𝐴) +R ((1st𝐴) ·R -1R)), 0R⟩ = 0)
162, 15syl 14 . . 3 (𝐴 ∈ ℝ → ⟨((1st𝐴) +R ((1st𝐴) ·R -1R)), 0R⟩ = 0)
179, 11, 163eqtrd 2275 . 2 (𝐴 ∈ ℝ → (𝐴 + ⟨((1st𝐴) ·R -1R), 0R⟩) = 0)
18 oveq2 6087 . . . 4 (𝑥 = ⟨((1st𝐴) ·R -1R), 0R⟩ → (𝐴 + 𝑥) = (𝐴 + ⟨((1st𝐴) ·R -1R), 0R⟩))
1918eqeq1d 2247 . . 3 (𝑥 = ⟨((1st𝐴) ·R -1R), 0R⟩ → ((𝐴 + 𝑥) = 0 ↔ (𝐴 + ⟨((1st𝐴) ·R -1R), 0R⟩) = 0))
2019rspcev 2929 . 2 ((⟨((1st𝐴) ·R -1R), 0R⟩ ∈ ℝ ∧ (𝐴 + ⟨((1st𝐴) ·R -1R), 0R⟩) = 0) → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
217, 17, 20syl2anc 415 1 (𝐴 ∈ ℝ → ∃𝑥 ∈ ℝ (𝐴 + 𝑥) = 0)
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1402  wcel 2209  wrex 2529  cop 3711  cfv 5375  (class class class)co 6079  1st c1st 6366  Rcnr 7658  0Rc0r 7659  -1Rcm1r 7661   +R cplr 7662   ·R cmr 7663  cr 8172  0cc0 8173   + 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-i1p 7828  df-iplp 7829  df-imp 7830  df-enr 8087  df-nr 8088  df-plr 8089  df-mr 8090  df-0r 8092  df-1r 8093  df-m1r 8094  df-c 8179  df-0 8180  df-r 8183  df-add 8184
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator