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

Theorem 0idsr 11212
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 11171 . 2 R = ((P × P) / ~R )
2 oveq1 7453 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = (𝐴 +R 0R))
3 id 23 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → [⟨𝑥, 𝑦⟩] ~R = 𝐴)
42, 3eqeq12d 2779 . 2 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R ↔ (𝐴 +R 0R) = 𝐴))
5 df-0r 11175 . . . 4 0R = [⟨1P, 1P⟩] ~R
65oveq2i 7457 . . 3 ([⟨𝑥, 𝑦⟩] ~R +R 0R) = ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R )
7 1pr 11130 . . . . 5 1P ∈ P
8 addsrpr 11190 . . . . 5 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (1P ∈ P ∧ 1P ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
97, 7, 8mpanr12 718 . . . 4 ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
10 addclpr 11133 . . . . . . 7 ((𝑥 ∈ P ∧ 1P ∈ P) → (𝑥 +P 1P) ∈ P)
117, 10mpan2 704 . . . . . 6 (𝑥 ∈ P → (𝑥 +P 1P) ∈ P)
12 addclpr 11133 . . . . . . 7 ((𝑦 ∈ P ∧ 1P ∈ P) → (𝑦 +P 1P) ∈ P)
137, 12mpan2 704 . . . . . 6 (𝑦 ∈ P → (𝑦 +P 1P) ∈ P)
1411, 13anim12i 625 . . . . 5 ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P))
15 vex 3458 . . . . . . 7 𝑥 ∈ V
16 vex 3458 . . . . . . 7 𝑦 ∈ V
177elexi 3476 . . . . . . 7 1P ∈ V
18 addcompr 11136 . . . . . . 7 (𝑧 +P 𝑤) = (𝑤 +P 𝑧)
19 addasspr 11137 . . . . . . 7 ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣))
2015, 16, 17, 18, 19caov12 7676 . . . . . 6 (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))
21 enreceq 11181 . . . . . 6 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R ↔ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))))
2220, 21mpbiri 261 . . . . 5 (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
2314, 22mpdan 700 . . . 4 ((𝑥 ∈ P ∧ 𝑦 ∈ P) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
249, 23eqtr4d 2801 . . 3 ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨𝑥, 𝑦⟩] ~R )
256, 24eqtrid 2810 . 2 ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R )
261, 4, 25ecoptocl 8859 1 (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2147  ⟨cop 4838  (class class class)co 7446  [cec 8746  Pcnp 10974  1Pc1p 10975   +P cpp 10976   ~R cer 10979  Rcnr 10980  0Rc0r 10981   +R cplr 10984
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778  ax-inf2 9672
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-int 4911  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6325  df-ord 6386  df-on 6387  df-lim 6388  df-suc 6389  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7449  df-oprab 7450  df-mpo 7451  df-om 7905  df-1st 8028  df-2nd 8029  df-frecs 8330  df-wrecs 8361  df-recs 8410  df-rdg 8449  df-1o 8507  df-oadd 8511  df-omul 8512  df-er 8748  df-ec 8750  df-qs 8754  df-ni 10987  df-pli 10988  df-mi 10989  df-lti 10990  df-plpq 11023  df-mpq 11024  df-ltpq 11025  df-enq 11026  df-nq 11027  df-erq 11028  df-plq 11029  df-mq 11030  df-1nq 11031  df-rq 11032  df-ltnq 11033  df-np 11096  df-1p 11097  df-plp 11098  df-ltp 11100  df-enr 11170  df-nr 11171  df-plr 11172  df-0r 11175
This theorem is used by:  addgt0sr  11219  sqgt0sr  11221  map2psrpr  11225  supsrlem  11226  addresr  11253  mulresr  11254  axi2m1  11274  axcnre  11279
  Copyright terms: Public domain W3C validator