Theorem quotcan 24898

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 24790	. . . . . . . . 9 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
2		simp2 1133	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘𝑆))
3	1, 2	sseldi 3965	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘ℂ))
4		simp1 1132	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘𝑆))
5	1, 4	sseldi 3965	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘ℂ))
6		quotcan.1	. . . . . . . . . . . 12 ⊢ 𝐻 = (𝐹 ∘f · 𝐺)
7		plymulcl 24811	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f · 𝐺) ∈ (Poly‘ℂ))
8	6, 7	eqeltrid 2917	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐻 ∈ (Poly‘ℂ))
9	8	3adant3 1128	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 ∈ (Poly‘ℂ))
10		simp3 1134	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ≠ 0𝑝)
11		quotcl2 24891	. . . . . . . . . 10 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
12	9, 3, 10, 11	syl3anc 1367	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
13		plysubcl 24812	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
14	5, 12, 13	syl2anc 586	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
15		plymul0or 24870	. . . . . . . 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 10618	. . . . . . . . . . . . 13 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ℂ ∈ V)
19		plyf 24788	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
20	4, 19	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹:ℂ⟶ℂ)
21		plyf 24788	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
22	2, 21	syl 17	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺:ℂ⟶ℂ)
23		mulcom 10623	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
24	23	adantl 484	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
25	18, 20, 22, 24	caofcom 7441	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f · 𝐺) = (𝐺 ∘f · 𝐹))
26	6, 25	syl5eq 2868	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 = (𝐺 ∘f · 𝐹))
27	26	oveq1d 7171	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
28		plyf 24788	. . . . . . . . . . 11 ⊢ ((𝐻 quot 𝐺) ∈ (Poly‘ℂ) → (𝐻 quot 𝐺):ℂ⟶ℂ)
29	12, 28	syl 17	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺):ℂ⟶ℂ)
30		subdi 11073	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
31	30	adantl 484	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
32	18, 22, 20, 29, 31	caofdi 7445	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
33	27, 32	eqtr4d 2859	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))
34	33	eqeq1d 2823	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝))
35	10	neneqd 3021	. . . . . . . 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 2821	. . . . . . . . . . 11 ⊢ (deg‘𝐺) = (deg‘𝐺)
41		eqid 2821	. . . . . . . . . . 11 ⊢ (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) = (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))
42	40, 41	dgrmul 24860	. . . . . . . . . 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 24823	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
46	2, 45	syl 17	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℕ0)
47	46	nn0red 11957	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℝ)
48		dgrcl 24823	. . . . . . . . . . 11 ⊢ ((𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
49	14, 48	syl 17	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
50		nn0addge1 11944	. . . . . . . . . 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 5070	. . . . . . . . 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 6674	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) = (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))))
56	55	breq2d 5078	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ↔ (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
57		plymulcl 24811	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
58	3, 12, 57	syl2anc 586	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
59		plysubcl 24812	. . . . . . . . . . . 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 24823	. . . . . . . . . . 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 11957	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℝ)
64	47, 63	lenltd 10786	. . . . . . . 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 3035	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺) → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
68		eqid 2821	. . . . . . 7 ⊢ (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))
69	68	quotdgr 24892	. . . . . 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 24271	. . . 4 ⊢ 0𝑝 = (ℂ × {0})
73	71, 72	syl6eq 2872	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}))
74		ofsubeq0 11635	. . . 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 2827	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) = 𝐹)

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 398   ∨ wo 843   ∧ w3a 1083   = wceq 1537   ∈ wcel 2114   ≠ wne 3016  Vcvv 3494  {csn 4567   class class class wbr 5066   × cxp 5553  ⟶wf 6351  ‘cfv 6355  (class class class)co 7156   ∘_f cof 7407  ℂcc 10535  ℝcr 10536  0cc0 10537   + caddc 10540   · cmul 10542   < clt 10675   ≤ cle 10676   − cmin 10870  ℕ₀cn0 11898  0_𝑝c0p 24270  Polycply 24774  degcdgr 24777   quot cquot 24879

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 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793  ax-rep 5190  ax-sep 5203  ax-nul 5210  ax-pow 5266  ax-pr 5330  ax-un 7461  ax-inf2 9104  ax-cnex 10593  ax-resscn 10594  ax-1cn 10595  ax-icn 10596  ax-addcl 10597  ax-addrcl 10598  ax-mulcl 10599  ax-mulrcl 10600  ax-mulcom 10601  ax-addass 10602  ax-mulass 10603  ax-distr 10604  ax-i2m1 10605  ax-1ne0 10606  ax-1rid 10607  ax-rnegex 10608  ax-rrecex 10609  ax-cnre 10610  ax-pre-lttri 10611  ax-pre-lttrn 10612  ax-pre-ltadd 10613  ax-pre-mulgt0 10614  ax-pre-sup 10615  ax-addf 10616

This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1540  df-fal 1550  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ne 3017  df-nel 3124  df-ral 3143  df-rex 3144  df-reu 3145  df-rmo 3146  df-rab 3147  df-v 3496  df-sbc 3773  df-csb 3884  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-pss 3954  df-nul 4292  df-if 4468  df-pw 4541  df-sn 4568  df-pr 4570  df-tp 4572  df-op 4574  df-uni 4839  df-int 4877  df-iun 4921  df-br 5067  df-opab 5129  df-mpt 5147  df-tr 5173  df-id 5460  df-eprel 5465  df-po 5474  df-so 5475  df-fr 5514  df-se 5515  df-we 5516  df-xp 5561  df-rel 5562  df-cnv 5563  df-co 5564  df-dm 5565  df-rn 5566  df-res 5567  df-ima 5568  df-pred 6148  df-ord 6194  df-on 6195  df-lim 6196  df-suc 6197  df-iota 6314  df-fun 6357  df-fn 6358  df-f 6359  df-f1 6360  df-fo 6361  df-f1o 6362  df-fv 6363  df-isom 6364  df-riota 7114  df-ov 7159  df-oprab 7160  df-mpo 7161  df-of 7409  df-om 7581  df-1st 7689  df-2nd 7690  df-wrecs 7947  df-recs 8008  df-rdg 8046  df-1o 8102  df-oadd 8106  df-er 8289  df-map 8408  df-pm 8409  df-en 8510  df-dom 8511  df-sdom 8512  df-fin 8513  df-sup 8906  df-inf 8907  df-oi 8974  df-card 9368  df-pnf 10677  df-mnf 10678  df-xr 10679  df-ltxr 10680  df-le 10681  df-sub 10872  df-neg 10873  df-div 11298  df-nn 11639  df-2 11701  df-3 11702  df-n0 11899  df-z 11983  df-uz 12245  df-rp 12391  df-fz 12894  df-fzo 13035  df-fl 13163  df-seq 13371  df-exp 13431  df-hash 13692  df-cj 14458  df-re 14459  df-im 14460  df-sqrt 14594  df-abs 14595  df-clim 14845  df-rlim 14846  df-sum 15043  df-0p 24271  df-ply 24778  df-coe 24780  df-dgr 24781  df-quot 24880

This theorem is referenced by: (None)