| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > deg1suble | Structured version Visualization version GIF version | ||
| Description: The degree of a difference of polynomials is bounded by the maximum of degrees. (Contributed by Stefan O'Rear, 26-Mar-2015.) |
| Ref | Expression |
|---|---|
| deg1addle.y | ⊢ 𝑌 = (Poly1‘𝑅) |
| deg1addle.d | ⊢ 𝐷 = (deg1‘𝑅) |
| deg1addle.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| deg1suble.b | ⊢ 𝐵 = (Base‘𝑌) |
| deg1suble.m | ⊢ − = (-g‘𝑌) |
| deg1suble.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
| deg1suble.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| Ref | Expression |
|---|---|
| deg1suble | ⊢ (𝜑 → (𝐷‘(𝐹 − 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | deg1addle.y | . . 3 ⊢ 𝑌 = (Poly1‘𝑅) | |
| 2 | deg1addle.d | . . 3 ⊢ 𝐷 = (deg1‘𝑅) | |
| 3 | deg1addle.r | . . 3 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 4 | deg1suble.b | . . 3 ⊢ 𝐵 = (Base‘𝑌) | |
| 5 | eqid 2736 | . . 3 ⊢ (+g‘𝑌) = (+g‘𝑌) | |
| 6 | deg1suble.f | . . 3 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 7 | 1 | ply1ring 22211 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑌 ∈ Ring) |
| 8 | ringgrp 20219 | . . . . 5 ⊢ (𝑌 ∈ Ring → 𝑌 ∈ Grp) | |
| 9 | 3, 7, 8 | 3syl 18 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ Grp) |
| 10 | deg1suble.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 11 | eqid 2736 | . . . . 5 ⊢ (invg‘𝑌) = (invg‘𝑌) | |
| 12 | 4, 11 | grpinvcl 18963 | . . . 4 ⊢ ((𝑌 ∈ Grp ∧ 𝐺 ∈ 𝐵) → ((invg‘𝑌)‘𝐺) ∈ 𝐵) |
| 13 | 9, 10, 12 | syl2anc 585 | . . 3 ⊢ (𝜑 → ((invg‘𝑌)‘𝐺) ∈ 𝐵) |
| 14 | 1, 2, 3, 4, 5, 6, 13 | deg1addle 26066 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹(+g‘𝑌)((invg‘𝑌)‘𝐺))) ≤ if((𝐷‘𝐹) ≤ (𝐷‘((invg‘𝑌)‘𝐺)), (𝐷‘((invg‘𝑌)‘𝐺)), (𝐷‘𝐹))) |
| 15 | deg1suble.m | . . . . 5 ⊢ − = (-g‘𝑌) | |
| 16 | 4, 5, 11, 15 | grpsubval 18961 | . . . 4 ⊢ ((𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 − 𝐺) = (𝐹(+g‘𝑌)((invg‘𝑌)‘𝐺))) |
| 17 | 6, 10, 16 | syl2anc 585 | . . 3 ⊢ (𝜑 → (𝐹 − 𝐺) = (𝐹(+g‘𝑌)((invg‘𝑌)‘𝐺))) |
| 18 | 17 | fveq2d 6844 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 − 𝐺)) = (𝐷‘(𝐹(+g‘𝑌)((invg‘𝑌)‘𝐺)))) |
| 19 | 1, 2, 3, 4, 11, 10 | deg1invg 26071 | . . . . 5 ⊢ (𝜑 → (𝐷‘((invg‘𝑌)‘𝐺)) = (𝐷‘𝐺)) |
| 20 | 19 | eqcomd 2742 | . . . 4 ⊢ (𝜑 → (𝐷‘𝐺) = (𝐷‘((invg‘𝑌)‘𝐺))) |
| 21 | 20 | breq2d 5097 | . . 3 ⊢ (𝜑 → ((𝐷‘𝐹) ≤ (𝐷‘𝐺) ↔ (𝐷‘𝐹) ≤ (𝐷‘((invg‘𝑌)‘𝐺)))) |
| 22 | 21, 20 | ifbieq1d 4491 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) = if((𝐷‘𝐹) ≤ (𝐷‘((invg‘𝑌)‘𝐺)), (𝐷‘((invg‘𝑌)‘𝐺)), (𝐷‘𝐹))) |
| 23 | 14, 18, 22 | 3brtr4d 5117 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 − 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2114 ifcif 4466 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 ≤ cle 11180 Basecbs 17179 +gcplusg 17220 Grpcgrp 18909 invgcminusg 18910 -gcsg 18911 Ringcrg 20214 Poly1cpl1 22140 deg1cdg1 26019 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-pre-sup 11116 ax-addf 11117 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-iin 4936 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-se 5585 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-isom 6507 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-of 7631 df-ofr 7632 df-om 7818 df-1st 7942 df-2nd 7943 df-supp 8111 df-tpos 8176 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-1o 8405 df-2o 8406 df-er 8643 df-map 8775 df-pm 8776 df-ixp 8846 df-en 8894 df-dom 8895 df-sdom 8896 df-fin 8897 df-fsupp 9275 df-sup 9355 df-oi 9425 df-card 9863 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-9 12251 df-n0 12438 df-z 12525 df-dec 12645 df-uz 12789 df-fz 13462 df-fzo 13609 df-seq 13964 df-hash 14293 df-struct 17117 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-ress 17201 df-plusg 17233 df-mulr 17234 df-starv 17235 df-sca 17236 df-vsca 17237 df-ip 17238 df-tset 17239 df-ple 17240 df-ds 17242 df-unif 17243 df-hom 17244 df-cco 17245 df-0g 17404 df-gsum 17405 df-prds 17410 df-pws 17412 df-mre 17548 df-mrc 17549 df-acs 17551 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-mhm 18751 df-submnd 18752 df-grp 18912 df-minusg 18913 df-sbg 18914 df-mulg 19044 df-subg 19099 df-ghm 19188 df-cntz 19292 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-cring 20217 df-oppr 20317 df-dvdsr 20337 df-unit 20338 df-invr 20368 df-subrng 20523 df-subrg 20547 df-rlreg 20671 df-lmod 20857 df-lss 20927 df-cnfld 21353 df-psr 21889 df-mpl 21891 df-opsr 21893 df-psr1 22143 df-ply1 22145 df-mdeg 26020 df-deg1 26021 |
| This theorem is referenced by: deg1sublt 26075 ply1divmo 26101 aks6d1c6lem3 42611 |
| Copyright terms: Public domain | W3C validator |