| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > dgrsub | Structured version Visualization version GIF version | ||
| Description: The degree of a difference of polynomials is at most the maximum of the degrees. (Contributed by Mario Carneiro, 26-Jul-2014.) |
| Ref | Expression |
|---|---|
| dgrsub.1 | ⊢ 𝑀 = (deg‘𝐹) |
| dgrsub.2 | ⊢ 𝑁 = (deg‘𝐺) |
| Ref | Expression |
|---|---|
| dgrsub | ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘f − 𝐺)) ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | plyssc 26573 | . . . 4 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) | |
| 2 | 1 | sseli 3909 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ)) |
| 3 | ssid 3935 | . . . . 5 ⊢ ℂ ⊆ ℂ | |
| 4 | neg1cn 12345 | . . . . 5 ⊢ -1 ∈ ℂ | |
| 5 | plyconst 26579 | . . . . 5 ⊢ ((ℂ ⊆ ℂ ∧ -1 ∈ ℂ) → (ℂ × { -1}) ∈ (Poly‘ℂ)) | |
| 6 | 3, 4, 5 | mp2an 705 | . . . 4 ⊢ (ℂ × { -1}) ∈ (Poly‘ℂ) |
| 7 | 1 | sseli 3909 | . . . 4 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ)) |
| 8 | plymulcl 26595 | . . . 4 ⊢ (((ℂ × { -1}) ∈ (Poly‘ℂ) ∧ 𝐺 ∈ (Poly‘ℂ)) → ((ℂ × { -1}) ∘f · 𝐺) ∈ (Poly‘ℂ)) | |
| 9 | 6, 7, 8 | sylancr 599 | . . 3 ⊢ (𝐺 ∈ (Poly‘𝑆) → ((ℂ × { -1}) ∘f · 𝐺) ∈ (Poly‘ℂ)) |
| 10 | dgrsub.1 | . . . 4 ⊢ 𝑀 = (deg‘𝐹) | |
| 11 | eqid 2763 | . . . 4 ⊢ (deg‘((ℂ × { -1}) ∘f · 𝐺)) = (deg‘((ℂ × { -1}) ∘f · 𝐺)) | |
| 12 | 10, 11 | dgradd 26641 | . . 3 ⊢ ((𝐹 ∈ (Poly‘ℂ) ∧ ((ℂ × { -1}) ∘f · 𝐺) ∈ (Poly‘ℂ)) → (deg‘(𝐹 ∘f + ((ℂ × { -1}) ∘f · 𝐺))) ≤ if(𝑀 ≤ (deg‘((ℂ × { -1}) ∘f · 𝐺)), (deg‘((ℂ × { -1}) ∘f · 𝐺)), 𝑀)) |
| 13 | 2, 9, 12 | syl2an 608 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘f + ((ℂ × { -1}) ∘f · 𝐺))) ≤ if(𝑀 ≤ (deg‘((ℂ × { -1}) ∘f · 𝐺)), (deg‘((ℂ × { -1}) ∘f · 𝐺)), 𝑀)) |
| 14 | cnex 11320 | . . . 4 ⊢ ℂ ∈ V | |
| 15 | plyf 26571 | . . . 4 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹:ℂ⟶ℂ) | |
| 16 | plyf 26571 | . . . 4 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺:ℂ⟶ℂ) | |
| 17 | ofnegsub 12358 | . . . 4 ⊢ ((ℂ ∈ V ∧ 𝐹:ℂ⟶ℂ ∧ 𝐺:ℂ⟶ℂ) → (𝐹 ∘f + ((ℂ × { -1}) ∘f · 𝐺)) = (𝐹 ∘f − 𝐺)) | |
| 18 | 14, 15, 16, 17 | mp3an3an 1497 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 ∘f + ((ℂ × { -1}) ∘f · 𝐺)) = (𝐹 ∘f − 𝐺)) |
| 19 | 18 | fveq2d 6920 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘f + ((ℂ × { -1}) ∘f · 𝐺))) = (deg‘(𝐹 ∘f − 𝐺))) |
| 20 | neg1ne0 12347 | . . . . . . 7 ⊢ -1 ≠ 0 | |
| 21 | dgrmulc 26645 | . . . . . . 7 ⊢ (( -1 ∈ ℂ ∧ -1 ≠ 0 ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘((ℂ × { -1}) ∘f · 𝐺)) = (deg‘𝐺)) | |
| 22 | 4, 20, 21 | mp3an12 1481 | . . . . . 6 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘((ℂ × { -1}) ∘f · 𝐺)) = (deg‘𝐺)) |
| 23 | dgrsub.2 | . . . . . 6 ⊢ 𝑁 = (deg‘𝐺) | |
| 24 | 22, 23 | eqtr4di 2816 | . . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘((ℂ × { -1}) ∘f · 𝐺)) = 𝑁) |
| 25 | 24 | adantl 487 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘((ℂ × { -1}) ∘f · 𝐺)) = 𝑁) |
| 26 | 25 | breq2d 5120 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝑀 ≤ (deg‘((ℂ × { -1}) ∘f · 𝐺)) ↔ 𝑀 ≤ 𝑁)) |
| 27 | 26, 25 | ifbieq1d 4510 | . 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → if(𝑀 ≤ (deg‘((ℂ × { -1}) ∘f · 𝐺)), (deg‘((ℂ × { -1}) ∘f · 𝐺)), 𝑀) = if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) |
| 28 | 13, 19, 27 | 3brtr3d 5142 | 1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹 ∘f − 𝐺)) ≤ if(𝑀 ≤ 𝑁, 𝑁, 𝑀)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2147 ≠ wne 2959 Vcvv 3454 ⊆ wss 3900 ifcif 4485 {csn 4588 class class class wbr 5108 × cxp 5656 ⟶wf 6562 ‘cfv 6566 (class class class)co 7451 ∘f cof 7723 ℂcc 11237 0cc0 11239 1c1 11240 + caddc 11242 · cmul 11244 ≤ cle 11383 − cmin 11580 -cneg 11581 Polycply 26557 degcdgr 26560 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-rep 5238 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-inf2 9679 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 ax-pre-sup 11317 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-se 5612 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-isom 6575 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-of 7725 df-om 7912 df-1st 8035 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-1o 8514 df-er 8755 df-map 8887 df-pm 8888 df-en 9012 df-dom 9013 df-sdom 9014 df-fin 9015 df-sup 9471 df-inf 9472 df-oi 9541 df-card 10057 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-div 12014 df-nn 12376 df-2 12445 df-3 12446 df-n0 12647 df-z 12734 df-uz 13006 df-rp 13161 df-fz 13680 df-fzo 13829 df-fl 13972 df-seq 14185 df-exp 14245 df-hash 14516 df-cj 15309 df-re 15310 df-im 15311 df-sqrt 15445 df-abs 15446 df-clim 15699 df-rlim 15700 df-sum 15898 df-0p 26046 df-ply 26561 df-coe 26563 df-dgr 26564 |
| This theorem is used by: dgrcolem2 26648 plydivlem4 26672 plydiveu 26674 dgrsub2 44402 |
| Copyright terms: Public domain | W3C validator |