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

Theorem quotval 26207
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 26112 . . 3 (Poly‘𝑆) ⊆ (Poly‘ℂ)
21sseli 3945 . 2 (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ))
31sseli 3945 . . 3 (𝐺 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ))
4 eldifsn 4753 . . . . 5 (𝐺 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↔ (𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝))
5 oveq1 7397 . . . . . . . . . . 11 (𝑔 = 𝐺 → (𝑔f · 𝑞) = (𝐺f · 𝑞))
6 oveq12 7399 . . . . . . . . . . 11 ((𝑓 = 𝐹 ∧ (𝑔f · 𝑞) = (𝐺f · 𝑞)) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
75, 6sylan2 593 . . . . . . . . . 10 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = (𝐹f − (𝐺f · 𝑞)))
8 quotval.1 . . . . . . . . . 10 𝑅 = (𝐹f − (𝐺f · 𝑞))
97, 8eqtr4di 2783 . . . . . . . . 9 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑓f − (𝑔f · 𝑞)) = 𝑅)
109sbceq1d 3761 . . . . . . . 8 ((𝑓 = 𝐹𝑔 = 𝐺) → ([(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ [𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
118ovexi 7424 . . . . . . . . . 10 𝑅 ∈ V
12 eqeq1 2734 . . . . . . . . . . 11 (𝑟 = 𝑅 → (𝑟 = 0𝑝𝑅 = 0𝑝))
13 fveq2 6861 . . . . . . . . . . . 12 (𝑟 = 𝑅 → (deg‘𝑟) = (deg‘𝑅))
1413breq1d 5120 . . . . . . . . . . 11 (𝑟 = 𝑅 → ((deg‘𝑟) < (deg‘𝑔) ↔ (deg‘𝑅) < (deg‘𝑔)))
1512, 14orbi12d 918 . . . . . . . . . 10 (𝑟 = 𝑅 → ((𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔))))
1611, 15sbcie 3798 . . . . . . . . 9 ([𝑅 / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔)) ↔ (𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝑔)))
17 simpr 484 . . . . . . . . . . . 12 ((𝑓 = 𝐹𝑔 = 𝐺) → 𝑔 = 𝐺)
1817fveq2d 6865 . . . . . . . . . . 11 ((𝑓 = 𝐹𝑔 = 𝐺) → (deg‘𝑔) = (deg‘𝐺))
1918breq2d 5122 . . . . . . . . . 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 7349 . . . . . 6 ((𝑓 = 𝐹𝑔 = 𝐺) → (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))) = (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))))
24 df-quot 26206 . . . . . 6 quot = (𝑓 ∈ (Poly‘ℂ), 𝑔 ∈ ((Poly‘ℂ) ∖ {0𝑝}) ↦ (𝑞 ∈ (Poly‘ℂ)[(𝑓f − (𝑔f · 𝑞)) / 𝑟](𝑟 = 0𝑝 ∨ (deg‘𝑟) < (deg‘𝑔))))
25 riotaex 7351 . . . . . 6 (𝑞 ∈ (Poly‘ℂ)(𝑅 = 0𝑝 ∨ (deg‘𝑅) < (deg‘𝐺))) ∈ V
2623, 24, 25ovmpoa 7547 . . . . 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 1540  wcel 2109  wne 2926  [wsbc 3756  cdif 3914  {csn 4592   class class class wbr 5110  cfv 6514  crio 7346  (class class class)co 7390  f cof 7654  cc 11073   · cmul 11080   < clt 11215  cmin 11412  0𝑝c0p 25577  Polycply 26096  degcdgr 26099   quot cquot 26205
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 2008  ax-8 2111  ax-9 2119  ax-10 2142  ax-11 2158  ax-12 2178  ax-ext 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714  ax-cnex 11131  ax-1cn 11133  ax-addcl 11135
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3or 1087  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2066  df-mo 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-pss 3937  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-tr 5218  df-id 5536  df-eprel 5541  df-po 5549  df-so 5550  df-fr 5594  df-we 5596  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-pred 6277  df-ord 6338  df-on 6339  df-lim 6340  df-suc 6341  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-riota 7347  df-ov 7393  df-oprab 7394  df-mpo 7395  df-om 7846  df-1st 7971  df-2nd 7972  df-frecs 8263  df-wrecs 8294  df-recs 8343  df-rdg 8381  df-map 8804  df-nn 12194  df-n0 12450  df-ply 26100  df-quot 26206
This theorem is referenced by:  quotlem  26215
  Copyright terms: Public domain W3C validator