Theorem 0idsr 11100

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.

Step	Hyp	Ref	Expression
1		df-nr 11059	. 2 ⊢ R = ((P × P) / ~R )
2		oveq1 7430	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = (𝐴 +R 0R))
3		id 23	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → [⟨𝑥, 𝑦⟩] ~R = 𝐴)
4	2, 3	eqeq12d 2782	. 2 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R ↔ (𝐴 +R 0R) = 𝐴))
5		df-0r 11063	. . . 4 ⊢ 0R = [⟨1P, 1P⟩] ~R
6	5	oveq2i 7434	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R +R 0R) = ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R )
7		1pr 11018	. . . . 5 ⊢ 1P ∈ P
8		addsrpr 11078	. . . . 5 ⊢ (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ (1P ∈ P ∧ 1P ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
9	7, 7, 8	mpanr12 718	. . . 4 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
10		addclpr 11021	. . . . . . 7 ⊢ ((𝑥 ∈ P ∧ 1P ∈ P) → (𝑥 +P 1P) ∈ P)
11	7, 10	mpan2 704	. . . . . 6 ⊢ (𝑥 ∈ P → (𝑥 +P 1P) ∈ P)
12		addclpr 11021	. . . . . . 7 ⊢ ((𝑦 ∈ P ∧ 1P ∈ P) → (𝑦 +P 1P) ∈ P)
13	7, 12	mpan2 704	. . . . . 6 ⊢ (𝑦 ∈ P → (𝑦 +P 1P) ∈ P)
14	11, 13	anim12i 625	. . . . 5 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P))
15		vex 3462	. . . . . . 7 ⊢ 𝑥 ∈ V
16		vex 3462	. . . . . . 7 ⊢ 𝑦 ∈ V
17	7	elexi 3480	. . . . . . 7 ⊢ 1P ∈ V
18		addcompr 11024	. . . . . . 7 ⊢ (𝑧 +P 𝑤) = (𝑤 +P 𝑧)
19		addasspr 11025	. . . . . . 7 ⊢ ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣))
20	15, 16, 17, 18, 19	caov12 7651	. . . . . 6 ⊢ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))
21		enreceq 11069	. . . . . 6 ⊢ (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → ([⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R ↔ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))))
22	20, 21	mpbiri 261	. . . . 5 ⊢ (((𝑥 ∈ P ∧ 𝑦 ∈ P) ∧ ((𝑥 +P 1P) ∈ P ∧ (𝑦 +P 1P) ∈ P)) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
23	14, 22	mpdan 700	. . . 4 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → [⟨𝑥, 𝑦⟩] ~R = [⟨(𝑥 +P 1P), (𝑦 +P 1P)⟩] ~R )
24	9, 23	eqtr4d 2804	. . 3 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨𝑥, 𝑦⟩] ~R )
25	6, 24	eqtrid 2813	. 2 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R )
26	1, 4, 25	ecoptocl 8814	1 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ⟨cop 4600  (class class class)co 7423  [cec 8701  Pcnp 10862  1_Pc1p 10863   +_P cpp 10864   ~_R cer 10867  Rcnr 10868  0_Rc0r 10869   +_R cplr 10872

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 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-inf2 9620

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 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-oadd 8466  df-omul 8467  df-er 8703  df-ec 8705  df-qs 8709  df-ni 10875  df-pli 10876  df-mi 10877  df-lti 10878  df-plpq 10911  df-mpq 10912  df-ltpq 10913  df-enq 10914  df-nq 10915  df-erq 10916  df-plq 10917  df-mq 10918  df-1nq 10919  df-rq 10920  df-ltnq 10921  df-np 10984  df-1p 10985  df-plp 10986  df-ltp 10988  df-enr 11058  df-nr 11059  df-plr 11060  df-0r 11063

This theorem is used by:  addgt0sr  11107  sqgt0sr  11109  map2psrpr  11113  supsrlem  11114  addresr  11141  mulresr  11142  axi2m1  11162  axcnre  11167