Theorem prsradd 8006

Description: Mapping from positive real addition to signed real addition. (Contributed by Jim Kingdon, 29-Jun-2021.)

Assertion

Ref	Expression
prsradd	⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R = ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ))

Proof of Theorem prsradd

Dummy variables 𝑓 𝑔 ℎ are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		1pr 7774	. . . 4 ⊢ 1P ∈ P
2		addclpr 7757	. . . 4 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → (𝐴 +P 1P) ∈ P)
3	1, 2	mpan2 425	. . 3 ⊢ (𝐴 ∈ P → (𝐴 +P 1P) ∈ P)
4		addclpr 7757	. . . 4 ⊢ ((𝐵 ∈ P ∧ 1P ∈ P) → (𝐵 +P 1P) ∈ P)
5	1, 4	mpan2 425	. . 3 ⊢ (𝐵 ∈ P → (𝐵 +P 1P) ∈ P)
6		addsrpr 7965	. . . . 5 ⊢ ((((𝐴 +P 1P) ∈ P ∧ 1P ∈ P) ∧ ((𝐵 +P 1P) ∈ P ∧ 1P ∈ P)) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
7	1, 6	mpanl2 435	. . . 4 ⊢ (((𝐴 +P 1P) ∈ P ∧ ((𝐵 +P 1P) ∈ P ∧ 1P ∈ P)) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
8	1, 7	mpanr2 438	. . 3 ⊢ (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
9	3, 5, 8	syl2an 289	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
10		simpl 109	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → 𝐴 ∈ P)
11	1	a1i 9	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → 1P ∈ P)
12		simpr 110	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → 𝐵 ∈ P)
13		addcomprg 7798	. . . . . . . 8 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
14	13	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
15		addassprg 7799	. . . . . . . 8 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P) → ((𝑓 +P 𝑔) +P ℎ) = (𝑓 +P (𝑔 +P ℎ)))
16	15	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P)) → ((𝑓 +P 𝑔) +P ℎ) = (𝑓 +P (𝑔 +P ℎ)))
17		addclpr 7757	. . . . . . . 8 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) ∈ P)
18	17	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) ∈ P)
19	10, 11, 12, 14, 16, 11, 18	caov4d 6207	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((𝐴 +P 𝐵) +P (1P +P 1P)))
20		addclpr 7757	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) ∈ P)
21		addclpr 7757	. . . . . . . . 9 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P)
22	1, 1, 21	mp2an 426	. . . . . . . 8 ⊢ (1P +P 1P) ∈ P
23	22	a1i 9	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (1P +P 1P) ∈ P)
24		addcomprg 7798	. . . . . . 7 ⊢ (((𝐴 +P 𝐵) ∈ P ∧ (1P +P 1P) ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
25	20, 23, 24	syl2anc 411	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
26	19, 25	eqtrd 2264	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
27	26	oveq1d 6033	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P))
28		addassprg 7799	. . . . 5 ⊢ (((1P +P 1P) ∈ P ∧ (𝐴 +P 𝐵) ∈ P ∧ 1P ∈ P) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
29	23, 20, 11, 28	syl3anc 1273	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
30	27, 29	eqtrd 2264	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
31		addclpr 7757	. . . . 5 ⊢ (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
32	3, 5, 31	syl2an 289	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
33		addclpr 7757	. . . . 5 ⊢ (((𝐴 +P 𝐵) ∈ P ∧ 1P ∈ P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
34	20, 11, 33	syl2anc 411	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
35		enreceq 7956	. . . . . 6 ⊢ (((((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P ∧ (1P +P 1P) ∈ P) ∧ (((𝐴 +P 𝐵) +P 1P) ∈ P ∧ 1P ∈ P)) → ([⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R ↔ (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P))))
36	1, 35	mpanr2 438	. . . . 5 ⊢ (((((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P ∧ (1P +P 1P) ∈ P) ∧ ((𝐴 +P 𝐵) +P 1P) ∈ P) → ([⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R ↔ (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P))))
37	22, 36	mpanl2 435	. . . 4 ⊢ ((((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P ∧ ((𝐴 +P 𝐵) +P 1P) ∈ P) → ([⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R ↔ (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P))))
38	32, 34, 37	syl2anc 411	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ([⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R ↔ (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P))))
39	30, 38	mpbird 167	. 2 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R )
40	9, 39	eqtr2d 2265	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R = ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1004   = wceq 1397   ∈ wcel 2202  ⟨cop 3672  (class class class)co 6018  [cec 6700  Pcnp 7511  1_Pc1p 7512   +_P cpp 7513   ~_R cer 7516   +_R cplr 7521

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 619  ax-in2 620  ax-io 716  ax-5 1495  ax-7 1496  ax-gen 1497  ax-ie1 1541  ax-ie2 1542  ax-8 1552  ax-10 1553  ax-11 1554  ax-i12 1555  ax-bndl 1557  ax-4 1558  ax-17 1574  ax-i9 1578  ax-ial 1582  ax-i5r 1583  ax-13 2204  ax-14 2205  ax-ext 2213  ax-coll 4204  ax-sep 4207  ax-nul 4215  ax-pow 4264  ax-pr 4299  ax-un 4530  ax-setind 4635  ax-iinf 4686

This theorem depends on definitions:  df-bi 117  df-dc 842  df-3or 1005  df-3an 1006  df-tru 1400  df-fal 1403  df-nf 1509  df-sb 1811  df-eu 2082  df-mo 2083  df-clab 2218  df-cleq 2224  df-clel 2227  df-nfc 2363  df-ne 2403  df-ral 2515  df-rex 2516  df-reu 2517  df-rab 2519  df-v 2804  df-sbc 3032  df-csb 3128  df-dif 3202  df-un 3204  df-in 3206  df-ss 3213  df-nul 3495  df-pw 3654  df-sn 3675  df-pr 3676  df-op 3678  df-uni 3894  df-int 3929  df-iun 3972  df-br 4089  df-opab 4151  df-mpt 4152  df-tr 4188  df-eprel 4386  df-id 4390  df-po 4393  df-iso 4394  df-iord 4463  df-on 4465  df-suc 4468  df-iom 4689  df-xp 4731  df-rel 4732  df-cnv 4733  df-co 4734  df-dm 4735  df-rn 4736  df-res 4737  df-ima 4738  df-iota 5286  df-fun 5328  df-fn 5329  df-f 5330  df-f1 5331  df-fo 5332  df-f1o 5333  df-fv 5334  df-ov 6021  df-oprab 6022  df-mpo 6023  df-1st 6303  df-2nd 6304  df-recs 6471  df-irdg 6536  df-1o 6582  df-2o 6583  df-oadd 6586  df-omul 6587  df-er 6702  df-ec 6704  df-qs 6708  df-ni 7524  df-pli 7525  df-mi 7526  df-lti 7527  df-plpq 7564  df-mpq 7565  df-enq 7567  df-nqqs 7568  df-plqqs 7569  df-mqqs 7570  df-1nqqs 7571  df-rq 7572  df-ltnqqs 7573  df-enq0 7644  df-nq0 7645  df-0nq0 7646  df-plq0 7647  df-mq0 7648  df-inp 7686  df-i1p 7687  df-iplp 7688  df-enr 7946  df-nr 7947  df-plr 7948

This theorem is referenced by:  caucvgsrlemcau  8013  caucvgsrlemgt1  8015