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

Theorem prsradd 7748
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.
StepHypRef Expression
1 1pr 7516 . . . 4 1PP
2 addclpr 7499 . . . 4 ((𝐴P ∧ 1PP) → (𝐴 +P 1P) ∈ P)
31, 2mpan2 423 . . 3 (𝐴P → (𝐴 +P 1P) ∈ P)
4 addclpr 7499 . . . 4 ((𝐵P ∧ 1PP) → (𝐵 +P 1P) ∈ P)
51, 4mpan2 423 . . 3 (𝐵P → (𝐵 +P 1P) ∈ P)
6 addsrpr 7707 . . . . 5 ((((𝐴 +P 1P) ∈ P ∧ 1PP) ∧ ((𝐵 +P 1P) ∈ P ∧ 1PP)) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
71, 6mpanl2 433 . . . 4 (((𝐴 +P 1P) ∈ P ∧ ((𝐵 +P 1P) ∈ P ∧ 1PP)) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
81, 7mpanr2 436 . . 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 )
93, 5, 8syl2an 287 . 2 ((𝐴P𝐵P) → ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ) = [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R )
10 simpl 108 . . . . . . 7 ((𝐴P𝐵P) → 𝐴P)
111a1i 9 . . . . . . 7 ((𝐴P𝐵P) → 1PP)
12 simpr 109 . . . . . . 7 ((𝐴P𝐵P) → 𝐵P)
13 addcomprg 7540 . . . . . . . 8 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1413adantl 275 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
15 addassprg 7541 . . . . . . . 8 ((𝑓P𝑔PP) → ((𝑓 +P 𝑔) +P ) = (𝑓 +P (𝑔 +P )))
1615adantl 275 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔PP)) → ((𝑓 +P 𝑔) +P ) = (𝑓 +P (𝑔 +P )))
17 addclpr 7499 . . . . . . . 8 ((𝑓P𝑔P) → (𝑓 +P 𝑔) ∈ P)
1817adantl 275 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) ∈ P)
1910, 11, 12, 14, 16, 11, 18caov4d 6037 . . . . . 6 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((𝐴 +P 𝐵) +P (1P +P 1P)))
20 addclpr 7499 . . . . . . 7 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
21 addclpr 7499 . . . . . . . . 9 ((1PP ∧ 1PP) → (1P +P 1P) ∈ P)
221, 1, 21mp2an 424 . . . . . . . 8 (1P +P 1P) ∈ P
2322a1i 9 . . . . . . 7 ((𝐴P𝐵P) → (1P +P 1P) ∈ P)
24 addcomprg 7540 . . . . . . 7 (((𝐴 +P 𝐵) ∈ P ∧ (1P +P 1P) ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2520, 23, 24syl2anc 409 . . . . . 6 ((𝐴P𝐵P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2619, 25eqtrd 2203 . . . . 5 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2726oveq1d 5868 . . . 4 ((𝐴P𝐵P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P))
28 addassprg 7541 . . . . 5 (((1P +P 1P) ∈ P ∧ (𝐴 +P 𝐵) ∈ P ∧ 1PP) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
2923, 20, 11, 28syl3anc 1233 . . . 4 ((𝐴P𝐵P) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
3027, 29eqtrd 2203 . . 3 ((𝐴P𝐵P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
31 addclpr 7499 . . . . 5 (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
323, 5, 31syl2an 287 . . . 4 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
33 addclpr 7499 . . . . 5 (((𝐴 +P 𝐵) ∈ P ∧ 1PP) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
3420, 11, 33syl2anc 409 . . . 4 ((𝐴P𝐵P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
35 enreceq 7698 . . . . . 6 (((((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P ∧ (1P +P 1P) ∈ P) ∧ (((𝐴 +P 𝐵) +P 1P) ∈ P ∧ 1PP)) → ([⟨((𝐴 +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))))
361, 35mpanr2 436 . . . . 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))))
3722, 36mpanl2 433 . . . 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))))
3832, 34, 37syl2anc 409 . . 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))))
3930, 38mpbird 166 . 2 ((𝐴P𝐵P) → [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R )
409, 39eqtr2d 2204 1 ((𝐴P𝐵P) → [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R = ([⟨(𝐴 +P 1P), 1P⟩] ~R +R [⟨(𝐵 +P 1P), 1P⟩] ~R ))
Colors of variables: wff set class
Syntax hints:  wi 4  wa 103  wb 104  w3a 973   = wceq 1348  wcel 2141  cop 3586  (class class class)co 5853  [cec 6511  Pcnp 7253  1Pc1p 7254   +P cpp 7255   ~R cer 7258   +R cplr 7263
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 609  ax-in2 610  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-13 2143  ax-14 2144  ax-ext 2152  ax-coll 4104  ax-sep 4107  ax-nul 4115  ax-pow 4160  ax-pr 4194  ax-un 4418  ax-setind 4521  ax-iinf 4572
This theorem depends on definitions:  df-bi 116  df-dc 830  df-3or 974  df-3an 975  df-tru 1351  df-fal 1354  df-nf 1454  df-sb 1756  df-eu 2022  df-mo 2023  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ne 2341  df-ral 2453  df-rex 2454  df-reu 2455  df-rab 2457  df-v 2732  df-sbc 2956  df-csb 3050  df-dif 3123  df-un 3125  df-in 3127  df-ss 3134  df-nul 3415  df-pw 3568  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-int 3832  df-iun 3875  df-br 3990  df-opab 4051  df-mpt 4052  df-tr 4088  df-eprel 4274  df-id 4278  df-po 4281  df-iso 4282  df-iord 4351  df-on 4353  df-suc 4356  df-iom 4575  df-xp 4617  df-rel 4618  df-cnv 4619  df-co 4620  df-dm 4621  df-rn 4622  df-res 4623  df-ima 4624  df-iota 5160  df-fun 5200  df-fn 5201  df-f 5202  df-f1 5203  df-fo 5204  df-f1o 5205  df-fv 5206  df-ov 5856  df-oprab 5857  df-mpo 5858  df-1st 6119  df-2nd 6120  df-recs 6284  df-irdg 6349  df-1o 6395  df-2o 6396  df-oadd 6399  df-omul 6400  df-er 6513  df-ec 6515  df-qs 6519  df-ni 7266  df-pli 7267  df-mi 7268  df-lti 7269  df-plpq 7306  df-mpq 7307  df-enq 7309  df-nqqs 7310  df-plqqs 7311  df-mqqs 7312  df-1nqqs 7313  df-rq 7314  df-ltnqqs 7315  df-enq0 7386  df-nq0 7387  df-0nq0 7388  df-plq0 7389  df-mq0 7390  df-inp 7428  df-i1p 7429  df-iplp 7430  df-enr 7688  df-nr 7689  df-plr 7690
This theorem is referenced by:  caucvgsrlemcau  7755  caucvgsrlemgt1  7757
  Copyright terms: Public domain W3C validator