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

Theorem recidpirqlemcalc 8188
Description: Lemma for recidpirq 8189. 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 7885 . . . . . 6 1PP
32a1i 9 . . . . 5 (𝜑 → 1PP)
4 addclpr 7868 . . . . 5 ((𝐴P ∧ 1PP) → (𝐴 +P 1P) ∈ P)
51, 3, 4syl2anc 411 . . . 4 (𝜑 → (𝐴 +P 1P) ∈ P)
6 recidpirqlemcalc.b . . . . 5 (𝜑𝐵P)
7 addclpr 7868 . . . . 5 ((𝐵P ∧ 1PP) → (𝐵 +P 1P) ∈ P)
86, 3, 7syl2anc 411 . . . 4 (𝜑 → (𝐵 +P 1P) ∈ P)
9 addclpr 7868 . . . 4 (((𝐴 +P 1P) ∈ P ∧ (𝐵 +P 1P) ∈ P) → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
105, 8, 9syl2anc 411 . . 3 (𝜑 → ((𝐴 +P 1P) +P (𝐵 +P 1P)) ∈ P)
11 addassprg 7910 . . 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 1274 . 2 (𝜑 → ((((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) +P 1P) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P (1P +P 1P)))
13 distrprg 7919 . . . . . . 7 (((𝐴 +P 1P) ∈ P𝐵P ∧ 1PP) → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)))
145, 6, 3, 13syl3anc 1274 . . . . . 6 (𝜑 → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)))
15 1idpr 7923 . . . . . . . 8 ((𝐴 +P 1P) ∈ P → ((𝐴 +P 1P) ·P 1P) = (𝐴 +P 1P))
165, 15syl 14 . . . . . . 7 (𝜑 → ((𝐴 +P 1P) ·P 1P) = (𝐴 +P 1P))
1716oveq2d 6074 . . . . . 6 (𝜑 → (((𝐴 +P 1P) ·P 𝐵) +P ((𝐴 +P 1P) ·P 1P)) = (((𝐴 +P 1P) ·P 𝐵) +P (𝐴 +P 1P)))
18 mulcomprg 7911 . . . . . . . . 9 (((𝐴 +P 1P) ∈ P𝐵P) → ((𝐴 +P 1P) ·P 𝐵) = (𝐵 ·P (𝐴 +P 1P)))
195, 6, 18syl2anc 411 . . . . . . . 8 (𝜑 → ((𝐴 +P 1P) ·P 𝐵) = (𝐵 ·P (𝐴 +P 1P)))
20 distrprg 7919 . . . . . . . . 9 ((𝐵P𝐴P ∧ 1PP) → (𝐵 ·P (𝐴 +P 1P)) = ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)))
216, 1, 3, 20syl3anc 1274 . . . . . . . 8 (𝜑 → (𝐵 ·P (𝐴 +P 1P)) = ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)))
22 mulcomprg 7911 . . . . . . . . . . 11 ((𝐵P𝐴P) → (𝐵 ·P 𝐴) = (𝐴 ·P 𝐵))
236, 1, 22syl2anc 411 . . . . . . . . . 10 (𝜑 → (𝐵 ·P 𝐴) = (𝐴 ·P 𝐵))
24 recidpirqlemcalc.rec . . . . . . . . . 10 (𝜑 → (𝐴 ·P 𝐵) = 1P)
2523, 24eqtrd 2267 . . . . . . . . 9 (𝜑 → (𝐵 ·P 𝐴) = 1P)
26 1idpr 7923 . . . . . . . . . 10 (𝐵P → (𝐵 ·P 1P) = 𝐵)
276, 26syl 14 . . . . . . . . 9 (𝜑 → (𝐵 ·P 1P) = 𝐵)
2825, 27oveq12d 6076 . . . . . . . 8 (𝜑 → ((𝐵 ·P 𝐴) +P (𝐵 ·P 1P)) = (1P +P 𝐵))
2919, 21, 283eqtrd 2271 . . . . . . 7 (𝜑 → ((𝐴 +P 1P) ·P 𝐵) = (1P +P 𝐵))
3029oveq1d 6073 . . . . . 6 (𝜑 → (((𝐴 +P 1P) ·P 𝐵) +P (𝐴 +P 1P)) = ((1P +P 𝐵) +P (𝐴 +P 1P)))
3114, 17, 303eqtrd 2271 . . . . 5 (𝜑 → ((𝐴 +P 1P) ·P (𝐵 +P 1P)) = ((1P +P 𝐵) +P (𝐴 +P 1P)))
32 1idpr 7923 . . . . . 6 (1PP → (1P ·P 1P) = 1P)
332, 32mp1i 10 . . . . 5 (𝜑 → (1P ·P 1P) = 1P)
3431, 33oveq12d 6076 . . . 4 (𝜑 → (((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) = (((1P +P 𝐵) +P (𝐴 +P 1P)) +P 1P))
35 addcomprg 7909 . . . . . . . 8 ((1PP𝐵P) → (1P +P 𝐵) = (𝐵 +P 1P))
363, 6, 35syl2anc 411 . . . . . . 7 (𝜑 → (1P +P 𝐵) = (𝐵 +P 1P))
3736oveq1d 6073 . . . . . 6 (𝜑 → ((1P +P 𝐵) +P (𝐴 +P 1P)) = ((𝐵 +P 1P) +P (𝐴 +P 1P)))
38 addcomprg 7909 . . . . . . 7 (((𝐵 +P 1P) ∈ P ∧ (𝐴 +P 1P) ∈ P) → ((𝐵 +P 1P) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
398, 5, 38syl2anc 411 . . . . . 6 (𝜑 → ((𝐵 +P 1P) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
4037, 39eqtrd 2267 . . . . 5 (𝜑 → ((1P +P 𝐵) +P (𝐴 +P 1P)) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
4140oveq1d 6073 . . . 4 (𝜑 → (((1P +P 𝐵) +P (𝐴 +P 1P)) +P 1P) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P))
4234, 41eqtrd 2267 . . 3 (𝜑 → (((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) = (((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P))
4342oveq1d 6073 . 2 (𝜑 → ((((𝐴 +P 1P) ·P (𝐵 +P 1P)) +P (1P ·P 1P)) +P 1P) = ((((𝐴 +P 1P) +P (𝐵 +P 1P)) +P 1P) +P 1P))
44 mulcomprg 7911 . . . . . 6 ((1PP ∧ (𝐵 +P 1P) ∈ P) → (1P ·P (𝐵 +P 1P)) = ((𝐵 +P 1P) ·P 1P))
453, 8, 44syl2anc 411 . . . . 5 (𝜑 → (1P ·P (𝐵 +P 1P)) = ((𝐵 +P 1P) ·P 1P))
46 1idpr 7923 . . . . . 6 ((𝐵 +P 1P) ∈ P → ((𝐵 +P 1P) ·P 1P) = (𝐵 +P 1P))
478, 46syl 14 . . . . 5 (𝜑 → ((𝐵 +P 1P) ·P 1P) = (𝐵 +P 1P))
4845, 47eqtrd 2267 . . . 4 (𝜑 → (1P ·P (𝐵 +P 1P)) = (𝐵 +P 1P))
4916, 48oveq12d 6076 . . 3 (𝜑 → (((𝐴 +P 1P) ·P 1P) +P (1P ·P (𝐵 +P 1P))) = ((𝐴 +P 1P) +P (𝐵 +P 1P)))
5049oveq1d 6073 . 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 2277 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 1398  wcel 2205  (class class class)co 6058  Pcnp 7622  1Pc1p 7623   +P cpp 7624   ·P cmp 7625
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 2207  ax-14 2208  ax-ext 2216  ax-coll 4230  ax-sep 4233  ax-nul 4241  ax-pow 4292  ax-pr 4327  ax-un 4559  ax-setind 4664  ax-iinf 4715
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 2085  df-mo 2086  df-clab 2221  df-cleq 2227  df-clel 2230  df-nfc 2375  df-ne 2415  df-ral 2527  df-rex 2528  df-reu 2529  df-rab 2531  df-v 2817  df-sbc 3046  df-csb 3142  df-dif 3216  df-un 3218  df-in 3220  df-ss 3227  df-nul 3513  df-pw 3676  df-sn 3700  df-pr 3701  df-op 3703  df-uni 3920  df-int 3955  df-iun 3998  df-br 4115  df-opab 4177  df-mpt 4178  df-tr 4214  df-eprel 4415  df-id 4419  df-po 4422  df-iso 4423  df-iord 4492  df-on 4494  df-suc 4497  df-iom 4718  df-xp 4760  df-rel 4761  df-cnv 4762  df-co 4763  df-dm 4764  df-rn 4765  df-res 4766  df-ima 4767  df-iota 5317  df-fun 5359  df-fn 5360  df-f 5361  df-f1 5362  df-fo 5363  df-f1o 5364  df-fv 5365  df-ov 6061  df-oprab 6062  df-mpo 6063  df-1st 6347  df-2nd 6348  df-recs 6549  df-irdg 6614  df-1o 6660  df-2o 6661  df-oadd 6664  df-omul 6665  df-er 6780  df-ec 6782  df-qs 6786  df-ni 7635  df-pli 7636  df-mi 7637  df-lti 7638  df-plpq 7675  df-mpq 7676  df-enq 7678  df-nqqs 7679  df-plqqs 7680  df-mqqs 7681  df-1nqqs 7682  df-rq 7683  df-ltnqqs 7684  df-enq0 7755  df-nq0 7756  df-0nq0 7757  df-plq0 7758  df-mq0 7759  df-inp 7797  df-i1p 7798  df-iplp 7799  df-imp 7800
This theorem is referenced by:  recidpirq  8189
  Copyright terms: Public domain W3C validator