Theorem quotcan 26507

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 26394	. . . . . . . . 9 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ)
2		simp2 1155	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘𝑆))
3	1, 2	sselid 3938	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ∈ (Poly‘ℂ))
4		simp1 1154	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘𝑆))
5	1, 4	sselid 3938	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 ∈ (Poly‘ℂ))
6		quotcan.1	. . . . . . . . . . . 12 ⊢ 𝐻 = (𝐹 ∘f · 𝐺)
7		plymulcl 26415	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f · 𝐺) ∈ (Poly‘ℂ))
8	6, 7	eqeltrid 2870	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → 𝐻 ∈ (Poly‘ℂ))
9	8	3adant3 1150	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 ∈ (Poly‘ℂ))
10		simp3 1156	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺 ≠ 0𝑝)
11		quotcl2 26500	. . . . . . . . . 10 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
12	9, 3, 10, 11	syl3anc 1398	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) ∈ (Poly‘ℂ))
13		plysubcl 26416	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
14	5, 12, 13	syl2anc 596	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
15		plymul0or 26476	. . . . . . . 8 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → ((𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
16	3, 14, 15	syl2anc 596	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
17		cnex 11199	. . . . . . . . . . . . 13 ⊢ ℂ ∈ V
18	17	a1i 11	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ℂ ∈ V)
19		plyf 26392	. . . . . . . . . . . . 13 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ)
20	4, 19	syl 18	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹:ℂ⟶ℂ)
21		plyf 26392	. . . . . . . . . . . . 13 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ)
22	2, 21	syl 18	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐺:ℂ⟶ℂ)
23		mulcom 11204	. . . . . . . . . . . . 13 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
24	23	adantl 487	. . . . . . . . . . . 12 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ)) → (𝑥 · 𝑦) = (𝑦 · 𝑥))
25	18, 20, 22, 24	caofcom 7724	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f · 𝐺) = (𝐺 ∘f · 𝐹))
26	6, 25	eqtrid 2813	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐻 = (𝐺 ∘f · 𝐹))
27	26	oveq1d 7438	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
28		plyf 26392	. . . . . . . . . . 11 ⊢ ((𝐻 quot 𝐺) ∈ (Poly‘ℂ) → (𝐻 quot 𝐺):ℂ⟶ℂ)
29	12, 28	syl 18	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺):ℂ⟶ℂ)
30		subdi 11665	. . . . . . . . . . 11 ⊢ ((𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
31	30	adantl 487	. . . . . . . . . 10 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ ℂ ∧ 𝑧 ∈ ℂ)) → (𝑥 · (𝑦 − 𝑧)) = ((𝑥 · 𝑦) − (𝑥 · 𝑧)))
32	18, 22, 20, 29, 31	caofdi 7729	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = ((𝐺 ∘f · 𝐹) ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))))
33	27, 32	eqtr4d 2804	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))
34	33	eqeq1d 2768	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))) = 0𝑝))
35	10	neneqd 2966	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ¬ 𝐺 = 0𝑝)
36		biorf 950	. . . . . . . 8 ⊢ (¬ 𝐺 = 0𝑝 → ((𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
37	35, 36	syl 18	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝 ↔ (𝐺 = 0𝑝 ∨ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)))
38	16, 34, 37	3bitr4d 314	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ↔ (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
39	38	biimpd 232	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
40		eqid 2766	. . . . . . . . . . 11 ⊢ (deg‘𝐺) = (deg‘𝐺)
41		eqid 2766	. . . . . . . . . . 11 ⊢ (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) = (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))
42	40, 41	dgrmul 26464	. . . . . . . . . 10 ⊢ (((𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) ∧ ((𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝)) → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
43	42	expr 462	. . . . . . . . 9 ⊢ (((𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) ∧ (𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
44	3, 10, 14, 43	syl21anc 851	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
45		dgrcl 26427	. . . . . . . . . . . 12 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
46	2, 45	syl 18	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℕ0)
47	46	nn0red 12584	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ∈ ℝ)
48		dgrcl 26427	. . . . . . . . . . 11 ⊢ ((𝐹 ∘f − (𝐻 quot 𝐺)) ∈ (Poly‘ℂ) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
49	14, 48	syl 18	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0)
50		nn0addge1 12568	. . . . . . . . . 10 ⊢ (((deg‘𝐺) ∈ ℝ ∧ (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))) ∈ ℕ0) → (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
51	47, 49, 50	syl2anc 596	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))))
52		breq2 5118	. . . . . . . . 9 ⊢ ((deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))) → ((deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) ↔ (deg‘𝐺) ≤ ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺))))))
53	51, 52	syl5ibrcom 250	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) = ((deg‘𝐺) + (deg‘(𝐹 ∘f − (𝐻 quot 𝐺)))) → (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
54	44, 53	syld 48	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
55	33	fveq2d 6892	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) = (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))))
56	55	breq2d 5126	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ↔ (deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺))))))
57		plymulcl 26415	. . . . . . . . . . . . 13 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐻 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
58	3, 12, 57	syl2anc 596	. . . . . . . . . . . 12 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ))
59		plysubcl 26416	. . . . . . . . . . . 12 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ (𝐺 ∘f · (𝐻 quot 𝐺)) ∈ (Poly‘ℂ)) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ))
60	9, 58, 59	syl2anc 596	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ))
61		dgrcl 26427	. . . . . . . . . . 11 ⊢ ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) ∈ (Poly‘ℂ) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℕ0)
62	60, 61	syl 18	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℕ0)
63	62	nn0red 12584	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ∈ ℝ)
64	47, 63	lenltd 11374	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) ↔ ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
65	56, 64	bitr3d 284	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘𝐺) ≤ (deg‘(𝐺 ∘f · (𝐹 ∘f − (𝐻 quot 𝐺)))) ↔ ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
66	54, 65	sylibd 242	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) ≠ 0𝑝 → ¬ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
67	66	necon4ad 2980	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺) → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝))
68		eqid 2766	. . . . . . 7 ⊢ (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = (𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))
69	68	quotdgr 26501	. . . . . 6 ⊢ ((𝐻 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ∨ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
70	9, 3, 10, 69	syl3anc 1398	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺))) = 0𝑝 ∨ (deg‘(𝐻 ∘f − (𝐺 ∘f · (𝐻 quot 𝐺)))) < (deg‘𝐺)))
71	39, 67, 70	mpjaod 874	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) = 0𝑝)
72		df-0p 25866	. . . 4 ⊢ 0𝑝 = (ℂ × {0})
73	71, 72	eqtrdi 2817	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}))
74		ofsubeq0 12233	. . . 4 ⊢ ((ℂ ∈ V ∧ 𝐹:ℂ⟶ℂ ∧ (𝐻 quot 𝐺):ℂ⟶ℂ) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}) ↔ 𝐹 = (𝐻 quot 𝐺)))
75	18, 20, 29, 74	syl3anc 1398	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → ((𝐹 ∘f − (𝐻 quot 𝐺)) = (ℂ × {0}) ↔ 𝐹 = (𝐻 quot 𝐺)))
76	73, 75	mpbid 235	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → 𝐹 = (𝐻 quot 𝐺))
77	76	eqcomd 2772	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐺 ≠ 0𝑝) → (𝐻 quot 𝐺) = 𝐹)

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∨ wo 861   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146   ≠ wne 2961  Vcvv 3458  {csn 4594   class class class wbr 5114   × cxp 5664  ⟶wf 6539  ‘cfv 6543  (class class class)co 7423   ∘_f cof 7685  ℂcc 11116  ℝcr 11117  0cc0 11118   + caddc 11121   · cmul 11123   < clt 11261   ≤ cle 11262   − cmin 11459  ℕ₀cn0 12522  0_𝑝c0p 25865  Polycply 26378  degcdgr 26381   quot cquot 26488

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-inf2 9620  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195  ax-pre-sup 11196

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-of 7687  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-er 8703  df-map 8835  df-pm 8836  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-sup 9412  df-inf 9413  df-oi 9482  df-card 9944  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-div 11890  df-nn 12252  df-2 12321  df-3 12322  df-n0 12523  df-z 12610  df-uz 12881  df-rp 13035  df-fz 13554  df-fzo 13702  df-fl 13845  df-seq 14058  df-exp 14118  df-hash 14387  df-cj 15176  df-re 15177  df-im 15178  df-sqrt 15312  df-abs 15313  df-clim 15565  df-rlim 15566  df-sum 15764  df-0p 25866  df-ply 26382  df-coe 26384  df-dgr 26385  df-quot 26489

This theorem is used by: (None)