![]() |
Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > facth | Structured version Visualization version GIF version |
Description: The factor theorem. If a polynomial 𝐹 has a root at 𝐴, then 𝐺 = 𝑥 − 𝐴 is a factor of 𝐹 (and the other factor is 𝐹 quot 𝐺). This is part of Metamath 100 proof #89. (Contributed by Mario Carneiro, 26-Jul-2014.) |
Ref | Expression |
---|---|
facth.1 | ⊢ 𝐺 = (Xp ∘f − (ℂ × {𝐴})) |
Ref | Expression |
---|---|
facth | ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | facth.1 | . . . . 5 ⊢ 𝐺 = (Xp ∘f − (ℂ × {𝐴})) | |
2 | eqid 2726 | . . . . 5 ⊢ (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) | |
3 | 1, 2 | plyrem 26333 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {(𝐹‘𝐴)})) |
4 | 3 | 3adant3 1129 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {(𝐹‘𝐴)})) |
5 | simp3 1135 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹‘𝐴) = 0) | |
6 | 5 | sneqd 4645 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → {(𝐹‘𝐴)} = {0}) |
7 | 6 | xpeq2d 5712 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (ℂ × {(𝐹‘𝐴)}) = (ℂ × {0})) |
8 | 4, 7 | eqtrd 2766 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0})) |
9 | cnex 11239 | . . . 4 ⊢ ℂ ∈ V | |
10 | 9 | a1i 11 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → ℂ ∈ V) |
11 | simp1 1133 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 ∈ (Poly‘𝑆)) | |
12 | plyf 26225 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ) | |
13 | 11, 12 | syl 17 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹:ℂ⟶ℂ) |
14 | 1 | plyremlem 26332 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐺 ∈ (Poly‘ℂ) ∧ (deg‘𝐺) = 1 ∧ (◡𝐺 “ {0}) = {𝐴})) |
15 | 14 | 3ad2ant2 1131 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∈ (Poly‘ℂ) ∧ (deg‘𝐺) = 1 ∧ (◡𝐺 “ {0}) = {𝐴})) |
16 | 15 | simp1d 1139 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐺 ∈ (Poly‘ℂ)) |
17 | plyssc 26227 | . . . . . . 7 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) | |
18 | 17, 11 | sselid 3977 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 ∈ (Poly‘ℂ)) |
19 | 15 | simp2d 1140 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (deg‘𝐺) = 1) |
20 | ax-1ne0 11227 | . . . . . . . . 9 ⊢ 1 ≠ 0 | |
21 | 20 | a1i 11 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 1 ≠ 0) |
22 | 19, 21 | eqnetrd 2998 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (deg‘𝐺) ≠ 0) |
23 | fveq2 6901 | . . . . . . . . 9 ⊢ (𝐺 = 0𝑝 → (deg‘𝐺) = (deg‘0𝑝)) | |
24 | dgr0 26290 | . . . . . . . . 9 ⊢ (deg‘0𝑝) = 0 | |
25 | 23, 24 | eqtrdi 2782 | . . . . . . . 8 ⊢ (𝐺 = 0𝑝 → (deg‘𝐺) = 0) |
26 | 25 | necon3i 2963 | . . . . . . 7 ⊢ ((deg‘𝐺) ≠ 0 → 𝐺 ≠ 0𝑝) |
27 | 22, 26 | syl 17 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐺 ≠ 0𝑝) |
28 | quotcl2 26330 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) | |
29 | 18, 16, 27, 28 | syl3anc 1368 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) |
30 | plymulcl 26248 | . . . . 5 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ)) | |
31 | 16, 29, 30 | syl2anc 582 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ)) |
32 | plyf 26225 | . . . 4 ⊢ ((𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ) → (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) | |
33 | 31, 32 | syl 17 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) |
34 | ofsubeq0 12261 | . . 3 ⊢ ((ℂ ∈ V ∧ 𝐹:ℂ⟶ℂ ∧ (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) → ((𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0}) ↔ 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺)))) | |
35 | 10, 13, 33, 34 | syl3anc 1368 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → ((𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0}) ↔ 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺)))) |
36 | 8, 35 | mpbid 231 | 1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ w3a 1084 = wceq 1534 ∈ wcel 2099 ≠ wne 2930 Vcvv 3462 {csn 4633 × cxp 5680 ◡ccnv 5681 “ cima 5685 ⟶wf 6550 ‘cfv 6554 (class class class)co 7424 ∘f cof 7688 ℂcc 11156 0cc0 11158 1c1 11159 · cmul 11163 − cmin 11494 0𝑝c0p 25689 Polycply 26211 Xpcidp 26212 degcdgr 26214 quot cquot 26318 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2697 ax-rep 5290 ax-sep 5304 ax-nul 5311 ax-pow 5369 ax-pr 5433 ax-un 7746 ax-inf2 9684 ax-cnex 11214 ax-resscn 11215 ax-1cn 11216 ax-icn 11217 ax-addcl 11218 ax-addrcl 11219 ax-mulcl 11220 ax-mulrcl 11221 ax-mulcom 11222 ax-addass 11223 ax-mulass 11224 ax-distr 11225 ax-i2m1 11226 ax-1ne0 11227 ax-1rid 11228 ax-rnegex 11229 ax-rrecex 11230 ax-cnre 11231 ax-pre-lttri 11232 ax-pre-lttrn 11233 ax-pre-ltadd 11234 ax-pre-mulgt0 11235 ax-pre-sup 11236 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2704 df-cleq 2718 df-clel 2803 df-nfc 2878 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3464 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-pss 3967 df-nul 4326 df-if 4534 df-pw 4609 df-sn 4634 df-pr 4636 df-op 4640 df-uni 4914 df-int 4955 df-iun 5003 df-br 5154 df-opab 5216 df-mpt 5237 df-tr 5271 df-id 5580 df-eprel 5586 df-po 5594 df-so 5595 df-fr 5637 df-se 5638 df-we 5639 df-xp 5688 df-rel 5689 df-cnv 5690 df-co 5691 df-dm 5692 df-rn 5693 df-res 5694 df-ima 5695 df-pred 6312 df-ord 6379 df-on 6380 df-lim 6381 df-suc 6382 df-iota 6506 df-fun 6556 df-fn 6557 df-f 6558 df-f1 6559 df-fo 6560 df-f1o 6561 df-fv 6562 df-isom 6563 df-riota 7380 df-ov 7427 df-oprab 7428 df-mpo 7429 df-of 7690 df-om 7877 df-1st 8003 df-2nd 8004 df-frecs 8296 df-wrecs 8327 df-recs 8401 df-rdg 8440 df-1o 8496 df-er 8734 df-map 8857 df-pm 8858 df-en 8975 df-dom 8976 df-sdom 8977 df-fin 8978 df-sup 9485 df-inf 9486 df-oi 9553 df-card 9982 df-pnf 11300 df-mnf 11301 df-xr 11302 df-ltxr 11303 df-le 11304 df-sub 11496 df-neg 11497 df-div 11922 df-nn 12265 df-2 12327 df-3 12328 df-n0 12525 df-z 12611 df-uz 12875 df-rp 13029 df-fz 13539 df-fzo 13682 df-fl 13812 df-seq 14022 df-exp 14082 df-hash 14348 df-cj 15104 df-re 15105 df-im 15106 df-sqrt 15240 df-abs 15241 df-clim 15490 df-rlim 15491 df-sum 15691 df-0p 25690 df-ply 26215 df-idp 26216 df-coe 26217 df-dgr 26218 df-quot 26319 |
This theorem is referenced by: fta1lem 26335 vieta1lem1 26338 vieta1lem2 26339 |
Copyright terms: Public domain | W3C validator |