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

Theorem quotval 26256
Description: Value of the quotient function. (Contributed by Mario Carneiro, 23-Jul-2014.)
Hypothesis
Ref Expression
quotval.1 𝑅 = (𝐹f − (𝐺f · 𝑞))
Assertion
Ref Expression
quotval ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
Distinct variable groups:   𝐹,𝑞   𝐺,𝑞
Allowed substitution hints:   𝑅(𝑞)   𝑆(𝑞)

Proof of Theorem quotval
Dummy variables 𝑓 𝑔 𝑟 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 plyssc 26161 . . 3 (Poly‘𝑆) ⊆ (Poly‘ℂ)
21sseli 3929 . 2 (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ))
31sseli 3929 . . 3 (𝐺 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ))
4 eldifsn 4742 . . . . 5 (𝐺 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↔ (𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝))
5 oveq1 7365 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑔f · 𝑞) = (𝐺f · 𝑞))
6 oveq12 7367 . . . . . . . . . . 11 ((𝑓 = 𝐹 ∧ (𝑔f · 𝑞) = (𝐺f · 𝑞)) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
75, 6sylan2 593 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
8 quotval.1 . . . . . . . . . 10 𝑅 = (𝐹f − (𝐺f · 𝑞))
97, 8eqtr4di 2789 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = 𝑅)
109sbceq1d 3745 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → ([(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ [𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
118ovexi 7392 . . . . . . . . . 10 𝑅 ∈ V
12 eqeq1 2740 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑟 = 0𝑝𝑅 = 0𝑝))
13 fveq2 6834 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (deg‘𝑟) = (deg‘𝑅))
1413breq1d 5108 . . . . . . . . . . 11 (𝑟 = 𝑅 → ((deg‘𝑟) < (deg‘𝑔) ↔ (deg‘𝑅) < (deg‘𝑔)))
1512, 14orbi12d 918 . . . . . . . . . 10 (𝑟 = 𝑅 → ((𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔))))
1611, 15sbcie 3782 . . . . . . . . 9 ([𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔)))
17 simpr 484 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
1817fveq2d 6838 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → (deg‘𝑔) = (deg‘𝐺))
1918breq2d 5110 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → ((deg‘𝑅) < (deg‘𝑔) ↔ (deg‘𝑅) < (deg‘𝐺)))
2019orbi2d 915 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → ((𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
2116, 20bitrid 283 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → ([𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
2210, 21bitrd 279 . . . . . . 7 ((𝑓 = 𝐹𝑔 = 𝐺) → ([(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
2322riotabidv 7317 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
24 df-quot 26255 . . . . . 6 quot = (𝑓 ∈ (Poly‘ℂ), 𝑔 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↦ (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
25 riotaex 7319 . . . . . 6 (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))) ∈ V
2623, 24, 25ovmpoa 7513 . . . . 5 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ ((Poly‘ℂ) ∖ {0𝑝})) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
274, 26sylan2br 595 . . . 4 ((𝐹 ∈ (Poly‘ℂ) ∧ (𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝)) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
28273impb 1114 . . 3 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
293, 28syl3an2 1164 . 2 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
302, 29syl3an1 1163 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 847  w3a 1086   = wceq 1541  wcel 2113  wne 2932  [wsbc 3740  cdif 3898  {csn 4580   class class class wbr 5098  cfv 6492  crio 7314  (class class class)co 7358  f cof 7620  cc 11024   · cmul 11031   < clt 11166  cmin 11364  0𝑝c0p 25626  Polycply 26145  degcdgr 26148   quot cquot 26254
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2184  ax-ext 2708  ax-rep 5224  ax-sep 5241  ax-nul 5251  ax-pow 5310  ax-pr 5377  ax-un 7680  ax-cnex 11082  ax-1cn 11084  ax-addcl 11086
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-reu 3351  df-rab 3400  df-v 3442  df-sbc 3741  df-csb 3850  df-dif 3904  df-un 3906  df-in 3908  df-ss 3918  df-pss 3921  df-nul 4286  df-if 4480  df-pw 4556  df-sn 4581  df-pr 4583  df-op 4587  df-uni 4864  df-iun 4948  df-br 5099  df-opab 5161  df-mpt 5180  df-tr 5206  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7315  df-ov 7361  df-oprab 7362  df-mpo 7363  df-om 7809  df-1st 7933  df-2nd 7934  df-frecs 8223  df-wrecs 8254  df-recs 8303  df-rdg 8341  df-map 8765  df-nn 12146  df-n0 12402  df-ply 26149  df-quot 26255
This theorem is referenced by:  quotlem  26264
  Copyright terms: Public domain W3C validator