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

Theorem prsradd 8100
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 7868 . . . 4 1PP
2 addclpr 7851 . . . 4 ((𝐴P ∧ 1PP) → (𝐴 +P 1P) ∈ P)
31, 2mpan2 425 . . 3 (𝐴P → (𝐴 +P 1P) ∈ P)
4 addclpr 7851 . . . 4 ((𝐵P ∧ 1PP) → (𝐵 +P 1P) ∈ P)
51, 4mpan2 425 . . 3 (𝐵P → (𝐵 +P 1P) ∈ P)
6 addsrpr 8059 . . . . 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 435 . . . 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 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 )
93, 5, 8syl2an 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)
111a1i 9 . . . . . . 7 ((𝐴P𝐵P) → 1PP)
12 simpr 110 . . . . . . 7 ((𝐴P𝐵P) → 𝐵P)
13 addcomprg 7892 . . . . . . . 8 ((𝑓P𝑔P) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
1413adantl 277 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) = (𝑔 +P 𝑓))
15 addassprg 7893 . . . . . . . 8 ((𝑓P𝑔PP) → ((𝑓 +P 𝑔) +P ) = (𝑓 +P (𝑔 +P )))
1615adantl 277 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔PP)) → ((𝑓 +P 𝑔) +P ) = (𝑓 +P (𝑔 +P )))
17 addclpr 7851 . . . . . . . 8 ((𝑓P𝑔P) → (𝑓 +P 𝑔) ∈ P)
1817adantl 277 . . . . . . 7 (((𝐴P𝐵P) ∧ (𝑓P𝑔P)) → (𝑓 +P 𝑔) ∈ P)
1910, 11, 12, 14, 16, 11, 18caov4d 6238 . . . . . 6 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((𝐴 +P 𝐵) +P (1P +P 1P)))
20 addclpr 7851 . . . . . . 7 ((𝐴P𝐵P) → (𝐴 +P 𝐵) ∈ P)
21 addclpr 7851 . . . . . . . . 9 ((1PP ∧ 1PP) → (1P +P 1P) ∈ P)
221, 1, 21mp2an 426 . . . . . . . 8 (1P +P 1P) ∈ P
2322a1i 9 . . . . . . 7 ((𝐴P𝐵P) → (1P +P 1P) ∈ P)
24 addcomprg 7892 . . . . . . 7 (((𝐴 +P 𝐵) ∈ P ∧ (1P +P 1P) ∈ P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2520, 23, 24syl2anc 411 . . . . . 6 ((𝐴P𝐵P) → ((𝐴 +P 𝐵) +P (1P +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2619, 25eqtrd 2265 . . . . 5 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) = ((1P +P 1P) +P (𝐴 +P 𝐵)))
2726oveq1d 6064 . . . 4 ((𝐴P𝐵P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P))
28 addassprg 7893 . . . . 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 1274 . . . 4 ((𝐴P𝐵P) → (((1P +P 1P) +P (𝐴 +P 𝐵)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
3027, 29eqtrd 2265 . . 3 ((𝐴P𝐵P) → (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) = ((1P +P 1P) +P ((𝐴 +P 𝐵) +P 1P)))
31 addclpr 7851 . . . . 5 (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
323, 5, 31syl2an 289 . . . 4 ((𝐴P𝐵P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
33 addclpr 7851 . . . . 5 (((𝐴 +P 𝐵) ∈ P ∧ 1PP) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
3420, 11, 33syl2anc 411 . . . 4 ((𝐴P𝐵P) → ((𝐴 +P 𝐵) +P 1P) ∈ P)
35 enreceq 8050 . . . . . 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 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))))
3722, 36mpanl2 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))))
3832, 34, 37syl2anc 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))))
3930, 38mpbird 167 . 2 ((𝐴P𝐵P) → [⟨((𝐴 +P 1P) +P (𝐵 +P 1P)), (1P +P 1P)⟩] ~R = [⟨((𝐴 +P 𝐵) +P 1P), 1P⟩] ~R )
409, 39eqtr2d 2266 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 104  wb 105  w3a 1005   = wceq 1398  wcel 2203  cop 3691  (class class class)co 6049  [cec 6764  Pcnp 7605  1Pc1p 7606   +P cpp 7607   ~R cer 7610   +R cplr 7615
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 717  ax-5 1496  ax-7 1497  ax-gen 1498  ax-ie1 1542  ax-ie2 1543  ax-8 1553  ax-10 1554  ax-11 1555  ax-i12 1556  ax-bndl 1558  ax-4 1559  ax-17 1575  ax-i9 1579  ax-ial 1583  ax-i5r 1584  ax-13 2205  ax-14 2206  ax-ext 2214  ax-coll 4224  ax-sep 4227  ax-nul 4235  ax-pow 4286  ax-pr 4321  ax-un 4553  ax-setind 4658  ax-iinf 4709
This theorem depends on definitions:  df-bi 117  df-dc 843  df-3or 1006  df-3an 1007  df-tru 1401  df-fal 1404  df-nf 1510  df-sb 1812  df-eu 2083  df-mo 2084  df-clab 2219  df-cleq 2225  df-clel 2228  df-nfc 2373  df-ne 2413  df-ral 2525  df-rex 2526  df-reu 2527  df-rab 2529  df-v 2814  df-sbc 3042  df-csb 3138  df-dif 3212  df-un 3214  df-in 3216  df-ss 3223  df-nul 3508  df-pw 3670  df-sn 3694  df-pr 3695  df-op 3697  df-uni 3914  df-int 3949  df-iun 3992  df-br 4109  df-opab 4171  df-mpt 4172  df-tr 4208  df-eprel 4409  df-id 4413  df-po 4416  df-iso 4417  df-iord 4486  df-on 4488  df-suc 4491  df-iom 4712  df-xp 4754  df-rel 4755  df-cnv 4756  df-co 4757  df-dm 4758  df-rn 4759  df-res 4760  df-ima 4761  df-iota 5311  df-fun 5353  df-fn 5354  df-f 5355  df-f1 5356  df-fo 5357  df-f1o 5358  df-fv 5359  df-ov 6052  df-oprab 6053  df-mpo 6054  df-1st 6333  df-2nd 6334  df-recs 6535  df-irdg 6600  df-1o 6646  df-2o 6647  df-oadd 6650  df-omul 6651  df-er 6766  df-ec 6768  df-qs 6772  df-ni 7618  df-pli 7619  df-mi 7620  df-lti 7621  df-plpq 7658  df-mpq 7659  df-enq 7661  df-nqqs 7662  df-plqqs 7663  df-mqqs 7664  df-1nqqs 7665  df-rq 7666  df-ltnqqs 7667  df-enq0 7738  df-nq0 7739  df-0nq0 7740  df-plq0 7741  df-mq0 7742  df-inp 7780  df-i1p 7781  df-iplp 7782  df-enr 8040  df-nr 8041  df-plr 8042
This theorem is referenced by:  caucvgsrlemcau  8107  caucvgsrlemgt1  8109
  Copyright terms: Public domain W3C validator