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

Theorem quotval 26268
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 26173 . . 3 (Poly‘𝑆) ⊆ (Poly‘ℂ)
21sseli 3931 . 2 (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ))
31sseli 3931 . . 3 (𝐺 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ))
4 eldifsn 4744 . . . . 5 (𝐺 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↔ (𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝))
5 oveq1 7375 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑔f · 𝑞) = (𝐺f · 𝑞))
6 oveq12 7377 . . . . . . . . . . 11 ((𝑓 = 𝐹 ∧ (𝑔f · 𝑞) = (𝐺f · 𝑞)) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
75, 6sylan2 594 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
8 quotval.1 . . . . . . . . . 10 𝑅 = (𝐹f − (𝐺f · 𝑞))
97, 8eqtr4di 2790 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = 𝑅)
109sbceq1d 3747 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → ([(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ [𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
118ovexi 7402 . . . . . . . . . 10 𝑅 ∈ V
12 eqeq1 2741 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑟 = 0𝑝𝑅 = 0𝑝))
13 fveq2 6842 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (deg‘𝑟) = (deg‘𝑅))
1413breq1d 5110 . . . . . . . . . . 11 (𝑟 = 𝑅 → ((deg‘𝑟) < (deg‘𝑔) ↔ (deg‘𝑅) < (deg‘𝑔)))
1512, 14orbi12d 919 . . . . . . . . . 10 (𝑟 = 𝑅 → ((𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔))))
1611, 15sbcie 3784 . . . . . . . . 9 ([𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔)))
17 simpr 484 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
1817fveq2d 6846 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → (deg‘𝑔) = (deg‘𝐺))
1918breq2d 5112 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → ((deg‘𝑅) < (deg‘𝑔) ↔ (deg‘𝑅) < (deg‘𝐺)))
2019orbi2d 916 . . . . . . . . 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 7327 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
24 df-quot 26267 . . . . . 6 quot = (𝑓 ∈ (Poly‘ℂ), 𝑔 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↦ (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
25 riotaex 7329 . . . . . 6 (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))) ∈ V
2623, 24, 25ovmpoa 7523 . . . . 5 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ ((Poly‘ℂ) ∖ {0𝑝})) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
274, 26sylan2br 596 . . . 4 ((𝐹 ∈ (Poly‘ℂ) ∧ (𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝)) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
28273impb 1115 . . 3 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
293, 28syl3an2 1165 . 2 ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
302, 29syl3an1 1164 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395  wo 848  w3a 1087   = wceq 1542  wcel 2114  wne 2933  [wsbc 3742  cdif 3900  {csn 4582   class class class wbr 5100  cfv 6500  crio 7324  (class class class)co 7368  f cof 7630  cc 11036   · cmul 11043   < clt 11178  cmin 11376  0𝑝c0p 25638  Polycply 26157  degcdgr 26160   quot cquot 26266
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-cnex 11094  ax-1cn 11096  ax-addcl 11098
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-ral 3053  df-rex 3063  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-map 8777  df-nn 12158  df-n0 12414  df-ply 26161  df-quot 26267
This theorem is referenced by:  quotlem  26276
  Copyright terms: Public domain W3C validator