MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  r1pval Structured version   Visualization version   GIF version

Theorem r1pval 26197
Description: Value of the polynomial remainder function. (Contributed by Stefan O'Rear, 28-Mar-2015.)
Hypotheses
Ref Expression
r1pval.e 𝐸 = (rem1p𝑅)
r1pval.p 𝑃 = (Poly1𝑅)
r1pval.b 𝐵 = (Base‘𝑃)
r1pval.q 𝑄 = (quot1p𝑅)
r1pval.t · = (.r𝑃)
r1pval.m = (-g𝑃)
Assertion
Ref Expression
r1pval ((𝐹𝐵𝐺𝐵) → (𝐹𝐸𝐺) = (𝐹 ((𝐹𝑄𝐺) · 𝐺)))

Proof of Theorem r1pval
Dummy variables 𝑏 𝑓 𝑔 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 r1pval.p . . . . 5 𝑃 = (Poly1𝑅)
2 r1pval.b . . . . 5 𝐵 = (Base‘𝑃)
31, 2elbasfv 17253 . . . 4 (𝐹𝐵𝑅 ∈ V)
43adantr 480 . . 3 ((𝐹𝐵𝐺𝐵) → 𝑅 ∈ V)
5 r1pval.e . . . 4 𝐸 = (rem1p𝑅)
6 fveq2 6906 . . . . . . . . . 10 (𝑟 = 𝑅 → (Poly1𝑟) = (Poly1𝑅))
76, 1eqtr4di 2795 . . . . . . . . 9 (𝑟 = 𝑅 → (Poly1𝑟) = 𝑃)
87fveq2d 6910 . . . . . . . 8 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = (Base‘𝑃))
98, 2eqtr4di 2795 . . . . . . 7 (𝑟 = 𝑅 → (Base‘(Poly1𝑟)) = 𝐵)
109csbeq1d 3903 . . . . . 6 (𝑟 = 𝑅(Base‘(Poly1𝑟)) / 𝑏(𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))) = 𝐵 / 𝑏(𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))))
112fvexi 6920 . . . . . . . 8 𝐵 ∈ V
1211a1i 11 . . . . . . 7 (𝑟 = 𝑅𝐵 ∈ V)
13 simpr 484 . . . . . . . 8 ((𝑟 = 𝑅𝑏 = 𝐵) → 𝑏 = 𝐵)
147fveq2d 6910 . . . . . . . . . . 11 (𝑟 = 𝑅 → (-g‘(Poly1𝑟)) = (-g𝑃))
15 r1pval.m . . . . . . . . . . 11 = (-g𝑃)
1614, 15eqtr4di 2795 . . . . . . . . . 10 (𝑟 = 𝑅 → (-g‘(Poly1𝑟)) = )
17 eqidd 2738 . . . . . . . . . 10 (𝑟 = 𝑅𝑓 = 𝑓)
187fveq2d 6910 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (.r‘(Poly1𝑟)) = (.r𝑃))
19 r1pval.t . . . . . . . . . . . 12 · = (.r𝑃)
2018, 19eqtr4di 2795 . . . . . . . . . . 11 (𝑟 = 𝑅 → (.r‘(Poly1𝑟)) = · )
21 fveq2 6906 . . . . . . . . . . . . 13 (𝑟 = 𝑅 → (quot1p𝑟) = (quot1p𝑅))
22 r1pval.q . . . . . . . . . . . . 13 𝑄 = (quot1p𝑅)
2321, 22eqtr4di 2795 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (quot1p𝑟) = 𝑄)
2423oveqd 7448 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑓(quot1p𝑟)𝑔) = (𝑓𝑄𝑔))
25 eqidd 2738 . . . . . . . . . . 11 (𝑟 = 𝑅𝑔 = 𝑔)
2620, 24, 25oveq123d 7452 . . . . . . . . . 10 (𝑟 = 𝑅 → ((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔) = ((𝑓𝑄𝑔) · 𝑔))
2716, 17, 26oveq123d 7452 . . . . . . . . 9 (𝑟 = 𝑅 → (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔)) = (𝑓 ((𝑓𝑄𝑔) · 𝑔)))
2827adantr 480 . . . . . . . 8 ((𝑟 = 𝑅𝑏 = 𝐵) → (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔)) = (𝑓 ((𝑓𝑄𝑔) · 𝑔)))
2913, 13, 28mpoeq123dv 7508 . . . . . . 7 ((𝑟 = 𝑅𝑏 = 𝐵) → (𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
3012, 29csbied 3935 . . . . . 6 (𝑟 = 𝑅𝐵 / 𝑏(𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
3110, 30eqtrd 2777 . . . . 5 (𝑟 = 𝑅(Base‘(Poly1𝑟)) / 𝑏(𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
32 df-r1p 26173 . . . . 5 rem1p = (𝑟 ∈ V ↦ (Base‘(Poly1𝑟)) / 𝑏(𝑓𝑏, 𝑔𝑏 ↦ (𝑓(-g‘(Poly1𝑟))((𝑓(quot1p𝑟)𝑔)(.r‘(Poly1𝑟))𝑔))))
3311, 11mpoex 8104 . . . . 5 (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))) ∈ V
3431, 32, 33fvmpt 7016 . . . 4 (𝑅 ∈ V → (rem1p𝑅) = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
355, 34eqtrid 2789 . . 3 (𝑅 ∈ V → 𝐸 = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
364, 35syl 17 . 2 ((𝐹𝐵𝐺𝐵) → 𝐸 = (𝑓𝐵, 𝑔𝐵 ↦ (𝑓 ((𝑓𝑄𝑔) · 𝑔))))
37 simpl 482 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑓 = 𝐹)
38 oveq12 7440 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓𝑄𝑔) = (𝐹𝑄𝐺))
39 simpr 484 . . . . 5 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
4038, 39oveq12d 7449 . . . 4 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑓𝑄𝑔) · 𝑔) = ((𝐹𝑄𝐺) · 𝐺))
4137, 40oveq12d 7449 . . 3 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓 ((𝑓𝑄𝑔) · 𝑔)) = (𝐹 ((𝐹𝑄𝐺) · 𝐺)))
4241adantl 481 . 2 (((𝐹𝐵𝐺𝐵) ∧ (𝑓 = 𝐹𝑔 = 𝐺)) → (𝑓 ((𝑓𝑄𝑔) · 𝑔)) = (𝐹 ((𝐹𝑄𝐺) · 𝐺)))
43 simpl 482 . 2 ((𝐹𝐵𝐺𝐵) → 𝐹𝐵)
44 simpr 484 . 2 ((𝐹𝐵𝐺𝐵) → 𝐺𝐵)
45 ovexd 7466 . 2 ((𝐹𝐵𝐺𝐵) → (𝐹 ((𝐹𝑄𝐺) · 𝐺)) ∈ V)
4636, 42, 43, 44, 45ovmpod 7585 1 ((𝐹𝐵𝐺𝐵) → (𝐹𝐸𝐺) = (𝐹 ((𝐹𝑄𝐺) · 𝐺)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1540  wcel 2108  Vcvv 3480  csb 3899  cfv 6561  (class class class)co 7431  cmpo 7433  Basecbs 17247  .rcmulr 17298  -gcsg 18953  Poly1cpl1 22178  quot1pcq1p 26167  rem1pcr1p 26168
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755  ax-cnex 11211  ax-1cn 11213  ax-addcl 11215
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-pss 3971  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-tr 5260  df-id 5578  df-eprel 5584  df-po 5592  df-so 5593  df-fr 5637  df-we 5639  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-pred 6321  df-ord 6387  df-on 6388  df-lim 6389  df-suc 6390  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-ov 7434  df-oprab 7435  df-mpo 7436  df-om 7888  df-1st 8014  df-2nd 8015  df-frecs 8306  df-wrecs 8337  df-recs 8411  df-rdg 8450  df-nn 12267  df-slot 17219  df-ndx 17231  df-base 17248  df-r1p 26173
This theorem is referenced by:  r1pcl  26198  r1pdeglt  26199  r1pid  26200  dvdsr1p  26203  ig1pdvds  26219  q1pdir  33623  q1pvsca  33624  r1pvsca  33625  r1pcyc  33627  r1padd1  33628  irredminply  33757
  Copyright terms: Public domain W3C validator