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

Theorem 0idsr 7829
Description: The signed real number 0 is an identity element for addition of signed reals. (Contributed by NM, 10-Apr-1996.)
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 7789 . 2 R = ((P × P) / ~R )
2 oveq1 5926 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = (𝐴 +R 0R))
3 id 19 . . 3 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → [⟨𝑥, 𝑦⟩] ~R = 𝐴)
42, 3eqeq12d 2208 . 2 ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R ↔ (𝐴 +R 0R) = 𝐴))
5 df-0r 7793 . . . 4 0R = [⟨1P, 1P⟩] ~R
65oveq2i 5930 . . 3 ([⟨𝑥, 𝑦⟩] ~R +R 0R) = ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R )
7 1pr 7616 . . . . 5 1PP
8 addsrpr 7807 . . . . 5 (((𝑥P𝑦P) ∧ (1PP ∧ 1PP)) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
97, 7, 8mpanr12 439 . . . 4 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
10 simpl 109 . . . . . 6 ((𝑥P𝑦P) → 𝑥P)
11 simpr 110 . . . . . 6 ((𝑥P𝑦P) → 𝑦P)
127a1i 9 . . . . . 6 ((𝑥P𝑦P) → 1PP)
13 addcomprg 7640 . . . . . . 7 ((𝑧P𝑤P) → (𝑧 +P 𝑤) = (𝑤 +P 𝑧))
1413adantl 277 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P)) → (𝑧 +P 𝑤) = (𝑤 +P 𝑧))
15 addassprg 7641 . . . . . . 7 ((𝑧P𝑤P𝑣P) → ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣)))
1615adantl 277 . . . . . 6 (((𝑥P𝑦P) ∧ (𝑧P𝑤P𝑣P)) → ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣)))
1710, 11, 12, 14, 16caov12d 6102 . . . . 5 ((𝑥P𝑦P) → (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P)))
18 addclpr 7599 . . . . . . . 8 ((𝑥P ∧ 1PP) → (𝑥 +P 1P) ∈ P)
197, 18mpan2 425 . . . . . . 7 (𝑥P → (𝑥 +P 1P) ∈ P)
20 addclpr 7599 . . . . . . . 8 ((𝑦P ∧ 1PP) → (𝑦 +P 1P) ∈ P)
217, 20mpan2 425 . . . . . . 7 (𝑦P → (𝑦 +P 1P) ∈ P)
2219, 21anim12i 338 . . . . . 6 ((𝑥P𝑦P) → ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P))
23 enreceq 7798 . . . . . 6 (((𝑥P𝑦P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R ↔ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))))
2422, 23mpdan 421 . . . . 5 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R ↔ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))))
2517, 24mpbird 167 . . . 4 ((𝑥P𝑦P) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
269, 25eqtr4d 2229 . . 3 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨𝑥, 𝑦⟩] ~R )
276, 26eqtrid 2238 . 2 ((𝑥P𝑦P) → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R )
281, 4, 27ecoptocl 6678 1 (𝐴R → (𝐴 +R 0R) = 𝐴)
Colors of variables: wff set class
Syntax hints:  wi 4  wa 104  wb 105  w3a 980   = wceq 1364  wcel 2164  cop 3622  (class class class)co 5919  [cec 6587  Pcnp 7353  1Pc1p 7354   +P cpp 7355   ~R cer 7358  Rcnr 7359  0Rc0r 7360   +R cplr 7363
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 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-nul 4156  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-iinf 4621
This theorem depends on definitions:  df-bi 117  df-dc 836  df-3or 981  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-ral 2477  df-rex 2478  df-reu 2479  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-tr 4129  df-eprel 4321  df-id 4325  df-po 4328  df-iso 4329  df-iord 4398  df-on 4400  df-suc 4403  df-iom 4624  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-recs 6360  df-irdg 6425  df-1o 6471  df-2o 6472  df-oadd 6475  df-omul 6476  df-er 6589  df-ec 6591  df-qs 6595  df-ni 7366  df-pli 7367  df-mi 7368  df-lti 7369  df-plpq 7406  df-mpq 7407  df-enq 7409  df-nqqs 7410  df-plqqs 7411  df-mqqs 7412  df-1nqqs 7413  df-rq 7414  df-ltnqqs 7415  df-enq0 7486  df-nq0 7487  df-0nq0 7488  df-plq0 7489  df-mq0 7490  df-inp 7528  df-i1p 7529  df-iplp 7530  df-enr 7788  df-nr 7789  df-plr 7790  df-0r 7793
This theorem is referenced by:  addgt0sr  7837  ltadd1sr  7838  ltm1sr  7839  caucvgsrlemoffval  7858  caucvgsrlemoffres  7862  caucvgsr  7864  map2psrprg  7867  suplocsrlempr  7869  addresr  7899  mulresr  7900  axi2m1  7937  ax0id  7940  axcnre  7943
  Copyright terms: Public domain W3C validator