| 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 2761 | . . . . 5 ⊢ (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) | |
| 3 | 1, 2 | plyrem 26357 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {(𝐹‘𝐴)})) |
| 4 | 3 | 3adant3 1144 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {(𝐹‘𝐴)})) |
| 5 | simp3 1150 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹‘𝐴) = 0) | |
| 6 | 5 | sneqd 4591 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → {(𝐹‘𝐴)} = {0}) |
| 7 | 6 | xpeq2d 5673 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (ℂ × {(𝐹‘𝐴)}) = (ℂ × {0})) |
| 8 | 4, 7 | eqtrd 2796 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0})) |
| 9 | cnex 11148 | . . . 4 ⊢ ℂ ∈ V | |
| 10 | 9 | a1i 11 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → ℂ ∈ V) |
| 11 | simp1 1148 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 ∈ (Poly‘𝑆)) | |
| 12 | plyf 26246 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ) | |
| 13 | 11, 12 | syl 17 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹:ℂ⟶ℂ) |
| 14 | 1 | plyremlem 26356 | . . . . . . 7 ⊢ (𝐴 ∈ ℂ → (𝐺 ∈ (Poly‘ℂ) ∧ (deg‘𝐺) = 1 ∧ (◡𝐺 “ {0}) = {𝐴})) |
| 15 | 14 | 3ad2ant2 1146 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∈ (Poly‘ℂ) ∧ (deg‘𝐺) = 1 ∧ (◡𝐺 “ {0}) = {𝐴})) |
| 16 | 15 | simp1d 1154 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐺 ∈ (Poly‘ℂ)) |
| 17 | plyssc 26248 | . . . . . . 7 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) | |
| 18 | 17, 11 | sselid 3932 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 ∈ (Poly‘ℂ)) |
| 19 | 15 | simp2d 1155 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (deg‘𝐺) = 1) |
| 20 | ax-1ne0 11136 | . . . . . . . . 9 ⊢ 1 ≠ 0 | |
| 21 | 20 | a1i 11 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 1 ≠ 0) |
| 22 | 19, 21 | eqnetrd 3023 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (deg‘𝐺) ≠ 0) |
| 23 | fveq2 6862 | . . . . . . . . 9 ⊢ (𝐺 = 0𝑝 → (deg‘𝐺) = (deg‘0𝑝)) | |
| 24 | dgr0 26310 | . . . . . . . . 9 ⊢ (deg‘0𝑝) = 0 | |
| 25 | 23, 24 | eqtrdi 2812 | . . . . . . . 8 ⊢ (𝐺 = 0𝑝 → (deg‘𝐺) = 0) |
| 26 | 25 | necon3i 2988 | . . . . . . 7 ⊢ ((deg‘𝐺) ≠ 0 → 𝐺 ≠ 0𝑝) |
| 27 | 22, 26 | syl 17 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐺 ≠ 0𝑝) |
| 28 | quotcl2 26354 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ) ∧ 𝐺 ≠ 0𝑝) → (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) | |
| 29 | 18, 16, 27, 28 | syl3anc 1389 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) |
| 30 | plymulcl 26269 | . . . . 5 ⊢ ((𝐺 ∈ (Poly‘ℂ) ∧ (𝐹 quot 𝐺) ∈ (Poly‘ℂ)) → (𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ)) | |
| 31 | 16, 29, 30 | syl2anc 593 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ)) |
| 32 | plyf 26246 | . . . 4 ⊢ ((𝐺 ∘f · (𝐹 quot 𝐺)) ∈ (Poly‘ℂ) → (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) | |
| 33 | 31, 32 | syl 17 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) |
| 34 | ofsubeq0 12186 | . . 3 ⊢ ((ℂ ∈ V ∧ 𝐹:ℂ⟶ℂ ∧ (𝐺 ∘f · (𝐹 quot 𝐺)):ℂ⟶ℂ) → ((𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0}) ↔ 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺)))) | |
| 35 | 10, 13, 33, 34 | syl3anc 1389 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → ((𝐹 ∘f − (𝐺 ∘f · (𝐹 quot 𝐺))) = (ℂ × {0}) ↔ 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺)))) |
| 36 | 8, 35 | mpbid 234 | 1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐴 ∈ ℂ ∧ (𝐹‘𝐴) = 0) → 𝐹 = (𝐺 ∘f · (𝐹 quot 𝐺))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ w3a 1097 = wceq 1559 ∈ wcel 2141 ≠ wne 2956 Vcvv 3453 {csn 4579 × cxp 5641 ◡ccnv 5642 “ cima 5646 ⟶wf 6512 ‘cfv 6516 (class class class)co 7391 ∘f cof 7653 ℂcc 11065 0cc0 11067 1c1 11068 · cmul 11072 − cmin 11408 0𝑝c0p 25719 Polycply 26232 Xpcidp 26233 degcdgr 26235 quot cquot 26342 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1814 ax-4 1828 ax-5 1929 ax-6 1986 ax-7 2027 ax-8 2143 ax-9 2151 ax-10 2174 ax-11 2190 ax-12 2211 ax-ext 2733 ax-rep 5224 ax-sep 5243 ax-nul 5253 ax-pow 5319 ax-pr 5387 ax-un 7713 ax-inf2 9590 ax-cnex 11123 ax-resscn 11124 ax-1cn 11125 ax-icn 11126 ax-addcl 11127 ax-addrcl 11128 ax-mulcl 11129 ax-mulrcl 11130 ax-mulcom 11131 ax-addass 11132 ax-mulass 11133 ax-distr 11134 ax-i2m1 11135 ax-1ne0 11136 ax-1rid 11137 ax-rnegex 11138 ax-rrecex 11139 ax-cnre 11140 ax-pre-lttri 11141 ax-pre-lttrn 11142 ax-pre-ltadd 11143 ax-pre-mulgt0 11144 ax-pre-sup 11145 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3or 1098 df-3an 1099 df-tru 1562 df-fal 1572 df-ex 1799 df-nf 1803 df-sb 2090 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-nel 3061 df-ral 3076 df-rex 3086 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3455 df-sbc 3743 df-csb 3851 df-dif 3905 df-un 3907 df-in 3909 df-ss 3919 df-pss 3922 df-nul 4284 df-if 4478 df-pw 4554 df-sn 4580 df-pr 4582 df-op 4586 df-uni 4863 df-int 4903 df-iun 4948 df-br 5098 df-opab 5160 df-mpt 5179 df-tr 5205 df-id 5538 df-eprel 5543 df-po 5551 df-so 5552 df-fr 5596 df-se 5597 df-we 5598 df-xp 5649 df-rel 5650 df-cnv 5651 df-co 5652 df-dm 5653 df-rn 5654 df-res 5655 df-ima 5656 df-pred 6283 df-ord 6344 df-on 6345 df-lim 6346 df-suc 6347 df-iota 6472 df-fun 6518 df-fn 6519 df-f 6520 df-f1 6521 df-fo 6522 df-f1o 6523 df-fv 6524 df-isom 6525 df-riota 7348 df-ov 7394 df-oprab 7395 df-mpo 7396 df-of 7655 df-om 7842 df-1st 7965 df-2nd 7966 df-frecs 8256 df-wrecs 8287 df-recs 8336 df-rdg 8375 df-1o 8431 df-er 8672 df-map 8804 df-pm 8805 df-en 8922 df-dom 8923 df-sdom 8924 df-fin 8925 df-sup 9382 df-inf 9383 df-oi 9452 df-card 9891 df-pnf 11212 df-mnf 11213 df-xr 11214 df-ltxr 11215 df-le 11216 df-sub 11410 df-neg 11411 df-div 11839 df-nn 12205 df-2 12274 df-3 12275 df-n0 12476 df-z 12563 df-uz 12834 df-rp 12988 df-fz 13507 df-fzo 13654 df-fl 13796 df-seq 14009 df-exp 14069 df-hash 14338 df-cj 15117 df-re 15118 df-im 15119 df-sqrt 15253 df-abs 15254 df-clim 15506 df-rlim 15507 df-sum 15705 df-0p 25720 df-ply 26236 df-idp 26237 df-coe 26238 df-dgr 26239 df-quot 26343 |
| This theorem is referenced by: fta1lem 26359 vieta1lem1 26362 vieta1lem2 26363 |
| Copyright terms: Public domain | W3C validator |