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

Theorem recidpirqlemcalc 7760
Description: Lemma for recidpirq 7761. Rearranging some of the expressions. (Contributed by Jim Kingdon, 17-Jul-2021.)
Hypotheses
Ref Expression
recidpirqlemcalc.a (𝜑𝐴P)
recidpirqlemcalc.b (𝜑𝐵P)
recidpirqlemcalc.rec (𝜑 → (𝐴 ·P 𝐵) = 1P)
Assertion
Ref Expression
recidpirqlemcalc (𝜑 → ((((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) +P 1P) = ((((𝐴 +P 1P) ·P 1P) +P (1P ·P (𝐵 +P 1P))) +P (1P +P 1P)))

Proof of Theorem recidpirqlemcalc
StepHypRef Expression
1 recidpirqlemcalc.a . . . . 5 (𝜑𝐴P)
2 1pr 7457 . . . . . 6 1PP
32a1i 9 . . . . 5 (𝜑 → 1PP)
4 addclpr 7440 . . . . 5 ((𝐴P ∧ 1PP) → (𝐴 +P 1P) ∈ P)
51, 3, 4syl2anc 409 . . . 4 (𝜑 → (𝐴 +P 1P) ∈ P)
6 recidpirqlemcalc.b . . . . 5 (𝜑𝐵P)
7 addclpr 7440 . . . . 5 ((𝐵P ∧ 1PP) → (𝐵 +P 1P) ∈ P)
86, 3, 7syl2anc 409 . . . 4 (𝜑 → (𝐵 +P 1P) ∈ P)
9 addclpr 7440 . . . 4 (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
105, 8, 9syl2anc 409 . . 3 (𝜑 → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
11 addassprg 7482 . . 3 ((((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P ∧ 1PP ∧ 1PP) → ((((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) +P 1P) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P (1P +P 1P)))
1210, 3, 3, 11syl3anc 1220 . 2 (𝜑 → ((((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) +P 1P) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P (1P +P 1P)))
13 distrprg 7491 . . . . . . 7 (((𝐴 +P 1P) ∈ P𝐵P ∧ 1PP) → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)))
145, 6, 3, 13syl3anc 1220 . . . . . 6 (𝜑 → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)))
15 1idpr 7495 . . . . . . . 8 ((𝐴 +P 1P) ∈ P → ((𝐴 +P 1P) ·P 1P) = (𝐴 +P 1P))
165, 15syl 14 . . . . . . 7 (𝜑 → ((𝐴 +P 1P) ·P 1P) = (𝐴 +P 1P))
1716oveq2d 5834 . . . . . 6 (𝜑 → (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P (𝐴 +P 1P)))
18 mulcomprg 7483 . . . . . . . . 9 (((𝐴 +P 1P) ∈ P𝐵P) → ((𝐴 +P 1P) ·P 𝐵) = (𝐵 ·P (𝐴 +P 1P)))
195, 6, 18syl2anc 409 . . . . . . . 8 (𝜑 → ((𝐴 +P 1P) ·P 𝐵) = (𝐵 ·P (𝐴 +P 1P)))
20 distrprg 7491 . . . . . . . . 9 ((𝐵P𝐴P ∧ 1PP) → (𝐵 ·P (𝐴 +P 1P)) = ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)))
216, 1, 3, 20syl3anc 1220 . . . . . . . 8 (𝜑 → (𝐵 ·P (𝐴 +P 1P)) = ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)))
22 mulcomprg 7483 . . . . . . . . . . 11 ((𝐵P𝐴P) → (𝐵 ·P 𝐴) = (𝐴 ·P 𝐵))
236, 1, 22syl2anc 409 . . . . . . . . . 10 (𝜑 → (𝐵 ·P 𝐴) = (𝐴 ·P 𝐵))
24 recidpirqlemcalc.rec . . . . . . . . . 10 (𝜑 → (𝐴 ·P 𝐵) = 1P)
2523, 24eqtrd 2190 . . . . . . . . 9 (𝜑 → (𝐵 ·P 𝐴) = 1P)
26 1idpr 7495 . . . . . . . . . 10 (𝐵P → (𝐵 ·P 1P) = 𝐵)
276, 26syl 14 . . . . . . . . 9 (𝜑 → (𝐵 ·P 1P) = 𝐵)
2825, 27oveq12d 5836 . . . . . . . 8 (𝜑 → ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)) = (1P +P 𝐵))
2919, 21, 283eqtrd 2194 . . . . . . 7 (𝜑 → ((𝐴 +P 1P) ·P 𝐵) = (1P +P 𝐵))
3029oveq1d 5833 . . . . . 6 (𝜑 → (((𝐴 +P 1P) ·P 𝐵) +P (𝐴 +P 1P)) = ((1P +P 𝐵) +P (𝐴 +P 1P)))
3114, 17, 303eqtrd 2194 . . . . 5 (𝜑 → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = ((1P +P 𝐵) +P (𝐴 +P 1P)))
32 1idpr 7495 . . . . . 6 (1PP → (1P ·P 1P) = 1P)
332, 32mp1i 10 . . . . 5 (𝜑 → (1P ·P 1P) = 1P)
3431, 33oveq12d 5836 . . . 4 (𝜑 → (((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) = (((1P +P 𝐵) +P (𝐴 +P 1P)) +P 1P))
35 addcomprg 7481 . . . . . . . 8 ((1PP𝐵P) → (1P +P 𝐵) = (𝐵 +P 1P))
363, 6, 35syl2anc 409 . . . . . . 7 (𝜑 → (1P +P 𝐵) = (𝐵 +P 1P))
3736oveq1d 5833 . . . . . 6 (𝜑 → ((1P +P 𝐵) +P (𝐴 +P 1P)) = ((𝐵 +P 1P) +P (𝐴 +P 1P)))
38 addcomprg 7481 . . . . . . 7 (((𝐵 +P 1P) ∈ P ∧ (𝐴 +P 1P) ∈ P) → ((𝐵 +P 1P) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
398, 5, 38syl2anc 409 . . . . . 6 (𝜑 → ((𝐵 +P 1P) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
4037, 39eqtrd 2190 . . . . 5 (𝜑 → ((1P +P 𝐵) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
4140oveq1d 5833 . . . 4 (𝜑 → (((1P +P 𝐵) +P (𝐴 +P 1P)) +P 1P) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P))
4234, 41eqtrd 2190 . . 3 (𝜑 → (((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P))
4342oveq1d 5833 . 2 (𝜑 → ((((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) +P 1P) = ((((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) +P 1P))
44 mulcomprg 7483 . . . . . 6 ((1PP ∧ (𝐵 +P 1P) ∈ P) → (1P ·P (𝐵 +P 1P)) = ((𝐵 +P 1P) ·P 1P))
453, 8, 44syl2anc 409 . . . . 5 (𝜑 → (1P ·P (𝐵 +P 1P)) = ((𝐵 +P 1P) ·P 1P))
46 1idpr 7495 . . . . . 6 ((𝐵 +P 1P) ∈ P → ((𝐵 +P 1P) ·P 1P) = (𝐵 +P 1P))
478, 46syl 14 . . . . 5 (𝜑 → ((𝐵 +P 1P) ·P 1P) = (𝐵 +P 1P))
4845, 47eqtrd 2190 . . . 4 (𝜑 → (1P ·P (𝐵 +P 1P)) = (𝐵 +P 1P))
4916, 48oveq12d 5836 . . 3 (𝜑 → (((𝐴 +P 1P) ·P 1P) +P (1P ·P (𝐵 +P 1P))) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
5049oveq1d 5833 . 2 (𝜑 → ((((𝐴 +P 1P) ·P 1P) +P (1P ·P (𝐵 +P 1P))) +P (1P +P 1P)) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P (1P +P 1P)))
5112, 43, 503eqtr4d 2200 1 (𝜑 → ((((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) +P 1P) = ((((𝐴 +P 1P) ·P 1P) +P (1P ·P (𝐵 +P 1P))) +P (1P +P 1P)))
Colors of variables: wff set class
Syntax hints:  wi 4   = wceq 1335  wcel 2128  (class class class)co 5818  Pcnp 7194  1Pc1p 7195   +P cpp 7196   ·P cmp 7197
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 604  ax-in2 605  ax-io 699  ax-5 1427  ax-7 1428  ax-gen 1429  ax-ie1 1473  ax-ie2 1474  ax-8 1484  ax-10 1485  ax-11 1486  ax-i12 1487  ax-bndl 1489  ax-4 1490  ax-17 1506  ax-i9 1510  ax-ial 1514  ax-i5r 1515  ax-13 2130  ax-14 2131  ax-ext 2139  ax-coll 4079  ax-sep 4082  ax-nul 4090  ax-pow 4134  ax-pr 4168  ax-un 4392  ax-setind 4494  ax-iinf 4545
This theorem depends on definitions:  df-bi 116  df-dc 821  df-3or 964  df-3an 965  df-tru 1338  df-fal 1341  df-nf 1441  df-sb 1743  df-eu 2009  df-mo 2010  df-clab 2144  df-cleq 2150  df-clel 2153  df-nfc 2288  df-ne 2328  df-ral 2440  df-rex 2441  df-reu 2442  df-rab 2444  df-v 2714  df-sbc 2938  df-csb 3032  df-dif 3104  df-un 3106  df-in 3108  df-ss 3115  df-nul 3395  df-pw 3545  df-sn 3566  df-pr 3567  df-op 3569  df-uni 3773  df-int 3808  df-iun 3851  df-br 3966  df-opab 4026  df-mpt 4027  df-tr 4063  df-eprel 4248  df-id 4252  df-po 4255  df-iso 4256  df-iord 4325  df-on 4327  df-suc 4330  df-iom 4548  df-xp 4589  df-rel 4590  df-cnv 4591  df-co 4592  df-dm 4593  df-rn 4594  df-res 4595  df-ima 4596  df-iota 5132  df-fun 5169  df-fn 5170  df-f 5171  df-f1 5172  df-fo 5173  df-f1o 5174  df-fv 5175  df-ov 5821  df-oprab 5822  df-mpo 5823  df-1st 6082  df-2nd 6083  df-recs 6246  df-irdg 6311  df-1o 6357  df-2o 6358  df-oadd 6361  df-omul 6362  df-er 6473  df-ec 6475  df-qs 6479  df-ni 7207  df-pli 7208  df-mi 7209  df-lti 7210  df-plpq 7247  df-mpq 7248  df-enq 7250  df-nqqs 7251  df-plqqs 7252  df-mqqs 7253  df-1nqqs 7254  df-rq 7255  df-ltnqqs 7256  df-enq0 7327  df-nq0 7328  df-0nq0 7329  df-plq0 7330  df-mq0 7331  df-inp 7369  df-i1p 7370  df-iplp 7371  df-imp 7372
This theorem is referenced by:  recidpirq  7761
  Copyright terms: Public domain W3C validator