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

Theorem 0idsr 10995
Description: The signed real number 0 is an identity element for addition of signed reals. (Contributed by NM, 10-Apr-1996.) (New usage is discouraged.)
Assertion
Ref Expression
0idsr (𝐴R → (𝐴 +R 0R) = 𝐴)

Proof of Theorem 0idsr
Dummy variables 𝑥 𝑦 𝑧 𝑤 𝑣 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 df-nr 10954 . 2 R = ((P × P) / ~R )
2 oveq1 7359 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = (𝐴 +R 0R))
3 id 22 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → [⟨𝑥, 𝑦⟩] ~R = 𝐴)
42, 3eqeq12d 2749 . 2 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R ↔ (𝐴 +R 0R) = 𝐴))
5 df-0r 10958 . . . 4 0R = [⟨1P, 1P⟩] ~R
65oveq2i 7363 . . 3 ([⟨𝑥, 𝑦⟩] ~R +R 0R) = ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R )
7 1pr 10913 . . . . 5 1PP
8 addsrpr 10973 . . . . 5 (((𝑥P𝑦P) ∧ (1PP ∧ 1PP)) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
97, 7, 8mpanr12 705 . . . 4 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
10 addclpr 10916 . . . . . . 7 ((𝑥P ∧ 1PP) → (𝑥 +P 1P) ∈ P)
117, 10mpan2 691 . . . . . 6 (𝑥P → (𝑥 +P 1P) ∈ P)
12 addclpr 10916 . . . . . . 7 ((𝑦P ∧ 1PP) → (𝑦 +P 1P) ∈ P)
137, 12mpan2 691 . . . . . 6 (𝑦P → (𝑦 +P 1P) ∈ P)
1411, 13anim12i 613 . . . . 5 ((𝑥P𝑦P) → ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P))
15 vex 3441 . . . . . . 7 𝑥 ∈ V
16 vex 3441 . . . . . . 7 𝑦 ∈ V
177elexi 3460 . . . . . . 7 1P ∈ V
18 addcompr 10919 . . . . . . 7 (𝑧 +P 𝑤) = (𝑤 +P 𝑧)
19 addasspr 10920 . . . . . . 7 ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣))
2015, 16, 17, 18, 19caov12 7580 . . . . . 6 (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))
21 enreceq 10964 . . . . . 6 (((𝑥P𝑦P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R ↔ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))))
2220, 21mpbiri 258 . . . . 5 (((𝑥P𝑦P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
2314, 22mpdan 687 . . . 4 ((𝑥P𝑦P) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
249, 23eqtr4d 2771 . . 3 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨𝑥, 𝑦⟩] ~R )
256, 24eqtrid 2780 . 2 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R )
261, 4, 25ecoptocl 8737 1 (𝐴R → (𝐴 +R 0R) = 𝐴)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1541  wcel 2113  cop 4581  (class class class)co 7352  [cec 8626  Pcnp 10757  1Pc1p 10758   +P cpp 10759   ~R cer 10762  Rcnr 10763  0Rc0r 10764   +R cplr 10767
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 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2705  ax-sep 5236  ax-nul 5246  ax-pow 5305  ax-pr 5372  ax-un 7674  ax-inf2 9538
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2566  df-clab 2712  df-cleq 2725  df-clel 2808  df-nfc 2882  df-ne 2930  df-ral 3049  df-rex 3058  df-rmo 3347  df-reu 3348  df-rab 3397  df-v 3439  df-sbc 3738  df-csb 3847  df-dif 3901  df-un 3903  df-in 3905  df-ss 3915  df-pss 3918  df-nul 4283  df-if 4475  df-pw 4551  df-sn 4576  df-pr 4578  df-op 4582  df-uni 4859  df-int 4898  df-iun 4943  df-br 5094  df-opab 5156  df-mpt 5175  df-tr 5201  df-id 5514  df-eprel 5519  df-po 5527  df-so 5528  df-fr 5572  df-we 5574  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-pred 6253  df-ord 6314  df-on 6315  df-lim 6316  df-suc 6317  df-iota 6442  df-fun 6488  df-fn 6489  df-f 6490  df-f1 6491  df-fo 6492  df-f1o 6493  df-fv 6494  df-ov 7355  df-oprab 7356  df-mpo 7357  df-om 7803  df-1st 7927  df-2nd 7928  df-frecs 8217  df-wrecs 8248  df-recs 8297  df-rdg 8335  df-1o 8391  df-oadd 8395  df-omul 8396  df-er 8628  df-ec 8630  df-qs 8634  df-ni 10770  df-pli 10771  df-mi 10772  df-lti 10773  df-plpq 10806  df-mpq 10807  df-ltpq 10808  df-enq 10809  df-nq 10810  df-erq 10811  df-plq 10812  df-mq 10813  df-1nq 10814  df-rq 10815  df-ltnq 10816  df-np 10879  df-1p 10880  df-plp 10881  df-ltp 10883  df-enr 10953  df-nr 10954  df-plr 10955  df-0r 10958
This theorem is referenced by:  addgt0sr  11002  sqgt0sr  11004  map2psrpr  11008  supsrlem  11009  addresr  11036  mulresr  11037  axi2m1  11057  axcnre  11062
  Copyright terms: Public domain W3C validator