Theorem quotcan 24901

Description: Exact division with a multiple. (Contributed by Mario Carneiro, 26-Jul-2014.)

Hypothesis

Ref	Expression
quotcan.1	⊢ 𝐻 = (𝐹 ∘f · 𝐺)

Assertion

Ref	Expression
quotcan	⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) = 𝐹)

Proof of Theorem quotcan

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		plyssc 24793	. . . . . . . . 9 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
2		simp2 1133	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘𝑆))
3	1, 2	sseldi 3968	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘ℂ))
4		simp1 1132	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘𝑆))
5	1, 4	sseldi 3968	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘ℂ))
6		quotcan.1	. . . . . . . . . . . 12 ⊢ 𝐻 = (𝐹 ∘f · 𝐺)
7		plymulcl 24814	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f · 𝐺) ∈ (Poly‘ℂ))
8	6, 7	eqeltrid 2920	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐻 ∈ (Poly‘ℂ))
9	8	3adant3 1128	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 ∈ (Poly‘ℂ))
10		simp3 1134	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ≠ 0𝑝)
11		quotcl2 24894	. . . . . . . . . 10 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
12	9, 3, 10, 11	syl3anc 1367	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
13		plysubcl 24815	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
14	5, 12, 13	syl2anc 586	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
15		plymul0or 24873	. . . . . . . 8 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → ((𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
16	3, 14, 15	syl2anc 586	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
17		cnex 10621	. . . . . . . . . . . . 13 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ℂ ∈ V)
19		plyf 24791	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
20	4, 19	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹:ℂ⟶ℂ)
21		plyf 24791	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
22	2, 21	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺:ℂ⟶ℂ)
23		mulcom 10626	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
24	23	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
25	18, 20, 22, 24	caofcom 7444	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f · 𝐺) = (𝐺 ∘f · 𝐹))
26	6, 25	syl5eq 2871	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 = (𝐺 ∘f · 𝐹))
27	26	oveq1d 7174	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
28		plyf 24791	. . . . . . . . . . 11 ⊢ ((𝐻 quot 𝐺) ∈ (Poly‘ℂ) → (𝐻 quot 𝐺):ℂ⟶ℂ)
29	12, 28	syl 17	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺):ℂ⟶ℂ)
30		subdi 11076	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
31	30	adantl 484	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
32	18, 22, 20, 29, 31	caofdi 7448	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
33	27, 32	eqtr4d 2862	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))
34	33	eqeq1d 2826	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝))
35	10	neneqd 3024	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ¬ 𝐺 = 0𝑝)
36		biorf 933	. . . . . . . 8 ⊢ (¬ 𝐺 = 0𝑝 → ((𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
37	35, 36	syl 17	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
38	16, 34, 37	3bitr4d 313	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
39	38	biimpd 231	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
40		eqid 2824	. . . . . . . . . . 11 ⊢ (deg‘𝐺) = (deg‘𝐺)
41		eqid 2824	. . . . . . . . . . 11 ⊢ (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) = (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))
42	40, 41	dgrmul 24863	. . . . . . . . . 10 ⊢ (((𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) ∧ ((𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝)) → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
43	42	expr 459	. . . . . . . . 9 ⊢ (((𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
44	3, 10, 14, 43	syl21anc 835	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
45		dgrcl 24826	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
46	2, 45	syl 17	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℕ0)
47	46	nn0red 11959	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℝ)
48		dgrcl 24826	. . . . . . . . . . 11 ⊢ ((𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
49	14, 48	syl 17	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
50		nn0addge1 11946	. . . . . . . . . 10 ⊢ (((deg‘𝐺) ∈ ℝ ∧ (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0) → (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
51	47, 49, 50	syl2anc 586	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
52		breq2 5073	. . . . . . . . 9 ⊢ ((deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))) → ((deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) ↔ (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
53	51, 52	syl5ibrcom 249	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))) → (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
54	44, 53	syld 47	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
55	33	fveq2d 6677	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) = (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))))
56	55	breq2d 5081	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ↔ (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
57		plymulcl 24814	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
58	3, 12, 57	syl2anc 586	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
59		plysubcl 24815	. . . . . . . . . . . 12 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ))
60	9, 58, 59	syl2anc 586	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ))
61		dgrcl 24826	. . . . . . . . . . 11 ⊢ ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℕ0)
62	60, 61	syl 17	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℕ0)
63	62	nn0red 11959	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℝ)
64	47, 63	lenltd 10789	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ↔ ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
65	56, 64	bitr3d 283	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) ↔ ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
66	54, 65	sylibd 241	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
67	66	necon4ad 3038	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺) → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
68		eqid 2824	. . . . . . 7 ⊢ (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))
69	68	quotdgr 24895	. . . . . 6 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ∨ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
70	9, 3, 10, 69	syl3anc 1367	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ∨ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
71	39, 67, 70	mpjaod 856	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)
72		df-0p 24274	. . . 4 ⊢ 0𝑝 = (ℂ × {0})
73	71, 72	syl6eq 2875	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}))
74		ofsubeq0 11638	. . . 4 ⊢ ((ℂ ∈ V ∧ 𝐹:ℂ⟶ℂ ∧ (𝐻 quot 𝐺):ℂ⟶ℂ) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}) ↔ 𝐹 = (𝐻 quot 𝐺)))
75	18, 20, 29, 74	syl3anc 1367	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}) ↔ 𝐹 = (𝐻 quot 𝐺)))
76	73, 75	mpbid 234	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 = (𝐻 quot 𝐺))
77	76	eqcomd 2830	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) = 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   ∧ w3a 1083   = wceq 1536   ∈ wcel 2113   ≠ wne 3019  Vcvv 3497  {csn 4570   class class class wbr 5069   × cxp 5556  ⟶wf 6354  ‘cfv 6358  (class class class)co 7159   ∘_f cof 7410  ℂcc 10538  ℝcr 10539  0cc0 10540   + caddc 10543   · cmul 10545   < clt 10678   ≤ cle 10679   − cmin 10873  ℕ₀cn0 11900  0_𝑝c0p 24273  Polycply 24777  degcdgr 24780   quot cquot 24882

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 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-inf2 9107  ax-cnex 10596  ax-resscn 10597  ax-1cn 10598  ax-icn 10599  ax-addcl 10600  ax-addrcl 10601  ax-mulcl 10602  ax-mulrcl 10603  ax-mulcom 10604  ax-addass 10605  ax-mulass 10606  ax-distr 10607  ax-i2m1 10608  ax-1ne0 10609  ax-1rid 10610  ax-rnegex 10611  ax-rrecex 10612  ax-cnre 10613  ax-pre-lttri 10614  ax-pre-lttrn 10615  ax-pre-ltadd 10616  ax-pre-mulgt0 10617  ax-pre-sup 10618  ax-addf 10619

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-fal 1549  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-se 5518  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-isom 6367  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-of 7412  df-om 7584  df-1st 7692  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-1o 8105  df-oadd 8109  df-er 8292  df-map 8411  df-pm 8412  df-en 8513  df-dom 8514  df-sdom 8515  df-fin 8516  df-sup 8909  df-inf 8910  df-oi 8977  df-card 9371  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-sub 10875  df-neg 10876  df-div 11301  df-nn 11642  df-2 11703  df-3 11704  df-n0 11901  df-z 11985  df-uz 12247  df-rp 12393  df-fz 12896  df-fzo 13037  df-fl 13165  df-seq 13373  df-exp 13433  df-hash 13694  df-cj 14461  df-re 14462  df-im 14463  df-sqrt 14597  df-abs 14598  df-clim 14848  df-rlim 14849  df-sum 15046  df-0p 24274  df-ply 24781  df-coe 24783  df-dgr 24784  df-quot 24883

This theorem is referenced by: (None)