Theorem prsradd 8160

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 7928	. . . 4 ⊢ 1P ∈ P
2		addclpr 7911	. . . 4 ⊢ ((𝐴 ∈ P ∧ 1P ∈ P) → (𝐴 +P 1P) ∈ P)
3	1, 2	mpan2 429	. . 3 ⊢ (𝐴 ∈ P → (𝐴 +P 1P) ∈ P)
4		addclpr 7911	. . . 4 ⊢ ((𝐵 ∈ P ∧ 1P ∈ P) → (𝐵 +P 1P) ∈ P)
5	1, 4	mpan2 429	. . 3 ⊢ (𝐵 ∈ P → (𝐵 +P 1P) ∈ P)
6		addsrpr 8119	. . . . 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 439	. . . 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 442	. . 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 7952	. . . . . . . 8 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
14	13	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
15		addassprg 7953	. . . . . . . 8 ⊢ ((𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P) → ((𝑓 +P 𝑔) +P ℎ) = (𝑓 +P (𝑔 +P ℎ)))
16	15	adantl 277	. . . . . . 7 ⊢ (((𝐴 ∈ P ∧ 𝐵 ∈ P) ∧ (𝑓 ∈ P ∧ 𝑔 ∈ P ∧ ℎ ∈ P)) → ((𝑓 +P 𝑔) +P ℎ) = (𝑓 +P (𝑔 +P ℎ)))
17		addclpr 7911	. . . . . . . 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 6277	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((𝐴 +P 𝐵) +P (1P +P 1P)))
20		addclpr 7911	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (𝐴 +P 𝐵) ∈ P)
21		addclpr 7911	. . . . . . . . 9 ⊢ ((1P ∈ P ∧ 1P ∈ P) → (1P +P 1P) ∈ P)
22	1, 1, 21	mp2an 430	. . . . . . . 8 ⊢ (1P +P 1P) ∈ P
23	22	a1i 9	. . . . . . 7 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (1P +P 1P) ∈ P)
24		addcomprg 7952	. . . . . . 7 ⊢ (((𝐴 +P 𝐵) ∈ P ∧ (1P +P 1P) ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
25	20, 23, 24	syl2anc 415	. . . . . 6 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
26	19, 25	eqtrd 2271	. . . . 5 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
27	26	oveq1d 6103	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P))
28		addassprg 7953	. . . . 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 1278	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
30	27, 29	eqtrd 2271	. . 3 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
31		addclpr 7911	. . . . 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 7911	. . . . 5 ⊢ (((𝐴 +P 𝐵) ∈ P ∧ 1P ∈ P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
34	20, 11, 33	syl2anc 415	. . . 4 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
35		enreceq 8110	. . . . . 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 442	. . . . 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 439	. . . 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 415	. . 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 2272	1 ⊢ ((𝐴 ∈ P ∧ 𝐵 ∈ P) → [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R = ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105   ∧ w3a 1009   = wceq 1402   ∈ wcel 2209  ⟨cop 3712  (class class class)co 6088  [cec 6809  Pcnp 7665  1_Pc1p 7666   +_P cpp 7667   ~_R cer 7670   +_R cplr 7675

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4248  ax-sep 4251  ax-nul 4261  ax-pow 4313  ax-pr 4348  ax-un 4580  ax-setind 4686  ax-iinf 4737

This proof depends on definitions:  df-bi 117  df-dc 847  df-3or 1010  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-ral 2533  df-rex 2534  df-reu 2535  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4132  df-opab 4194  df-mpt 4195  df-tr 4232  df-eprel 4436  df-id 4440  df-po 4443  df-iso 4444  df-iord 4513  df-on 4515  df-suc 4518  df-iom 4740  df-xp 4782  df-rel 4783  df-cnv 4784  df-co 4785  df-dm 4786  df-rn 4787  df-res 4788  df-ima 4789  df-iota 5340  df-fun 5382  df-fn 5383  df-f 5384  df-f1 5385  df-fo 5386  df-f1o 5387  df-fv 5388  df-ov 6091  df-oprab 6092  df-mpo 6093  df-1st 6378  df-2nd 6379  df-recs 6580  df-irdg 6645  df-1o 6691  df-2o 6692  df-oadd 6695  df-omul 6696  df-er 6811  df-ec 6813  df-qs 6817  df-ni 7678  df-pli 7679  df-mi 7680  df-lti 7681  df-plpq 7718  df-mpq 7719  df-enq 7721  df-nqqs 7722  df-plqqs 7723  df-mqqs 7724  df-1nqqs 7725  df-rq 7726  df-ltnqqs 7727  df-enq0 7798  df-nq0 7799  df-0nq0 7800  df-plq0 7801  df-mq0 7802  df-inp 7840  df-i1p 7841  df-iplp 7842  df-enr 8100  df-nr 8101  df-plr 8102

This theorem is used by:  caucvgsrlemcau  8167  caucvgsrlemgt1  8169