Theorem 0idsr 11110

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 11069	. 2 ⊢ R = ((P × P) / ~R )
2		oveq1 7424	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = (𝐴 +R 0R))
3		id 23	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → [⟨𝑥, 𝑦⟩] ~R = 𝐴)
4	2, 3	eqeq12d 2778	. 2 ⊢ ([⟨𝑥, 𝑦⟩] ~R = 𝐴 → (([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R ↔ (𝐴 +R 0R) = 𝐴))
5		df-0r 11073	. . . 4 ⊢ 0R = [⟨1P, 1P⟩] ~R
6	5	oveq2i 7428	. . 3 ⊢ ([⟨𝑥, 𝑦⟩] ~R +R 0R) = ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R )
7		1pr 11028	. . . . 5 ⊢ 1P ∈ P
8		addsrpr 11088	. . . . 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 11031	. . . . . . 7 ⊢ ((𝑥 ∈ P ∧ 1P ∈ P) → (𝑥 +P 1P) ∈ P)
11	7, 10	mpan2 704	. . . . . 6 ⊢ (𝑥 ∈ P → (𝑥 +P 1P) ∈ P)
12		addclpr 11031	. . . . . . 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 3457	. . . . . . 7 ⊢ 𝑥 ∈ V
16		vex 3457	. . . . . . 7 ⊢ 𝑦 ∈ V
17	7	elexi 3475	. . . . . . 7 ⊢ 1P ∈ V
18		addcompr 11034	. . . . . . 7 ⊢ (𝑧 +P 𝑤) = (𝑤 +P 𝑧)
19		addasspr 11035	. . . . . . 7 ⊢ ((𝑧 +P 𝑤) +P 𝑣) = (𝑧 +P (𝑤 +P 𝑣))
20	15, 16, 17, 18, 19	caov12 7646	. . . . . 6 ⊢ (𝑥 +P (𝑦 +P 1P)) = (𝑦 +P (𝑥 +P 1P))
21		enreceq 11079	. . . . . 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 2800	. . 3 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R [⟨1P, 1P⟩] ~R ) = [⟨𝑥, 𝑦⟩] ~R )
25	6, 24	eqtrid 2809	. 2 ⊢ ((𝑥 ∈ P ∧ 𝑦 ∈ P) → ([⟨𝑥, 𝑦⟩] ~R +R 0R) = [⟨𝑥, 𝑦⟩] ~R )
26	1, 4, 25	ecoptocl 8811	1 ⊢ (𝐴 ∈ R → (𝐴 +R 0R) = 𝐴)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2145  ⟨cop 4593  (class class class)co 7417  [cec 8698  Pcnp 10872  1_Pc1p 10873   +_P cpp 10874   ~_R cer 10877  Rcnr 10878  0_Rc0r 10879   +_R cplr 10882

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  ax-un 7740  ax-inf2 9624

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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-pss 3922  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-int 4911  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5554  df-eprel 5559  df-po 5567  df-so 5568  df-fr 5612  df-we 5614  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-pred 6303  df-ord 6364  df-on 6365  df-lim 6366  df-suc 6367  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-ov 7420  df-oprab 7421  df-mpo 7422  df-om 7867  df-1st 7990  df-2nd 7991  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-1o 8459  df-oadd 8463  df-omul 8464  df-er 8700  df-ec 8702  df-qs 8706  df-ni 10885  df-pli 10886  df-mi 10887  df-lti 10888  df-plpq 10921  df-mpq 10922  df-ltpq 10923  df-enq 10924  df-nq 10925  df-erq 10926  df-plq 10927  df-mq 10928  df-1nq 10929  df-rq 10930  df-ltnq 10931  df-np 10994  df-1p 10995  df-plp 10996  df-ltp 10998  df-enr 11068  df-nr 11069  df-plr 11070  df-0r 11073

This theorem is used by:  addgt0sr  11117  sqgt0sr  11119  map2psrpr  11123  supsrlem  11124  addresr  11151  mulresr  11152  axi2m1  11172  axcnre  11177