| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > deg1addlt | Structured version Visualization version GIF version | ||
| Description: If both factors have degree bounded by 𝐿, then the sum of the polynomials also has degree bounded by 𝐿. See also deg1addle 26087. (Contributed by Thierry Arnoux, 2-Apr-2025.) |
| Ref | Expression |
|---|---|
| deg1addlt.y | ⊢ 𝑌 = (Poly1‘𝑅) |
| deg1addlt.d | ⊢ 𝐷 = (deg1‘𝑅) |
| deg1addlt.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| deg1addlt.b | ⊢ 𝐵 = (Base‘𝑌) |
| deg1addlt.p | ⊢ + = (+g‘𝑌) |
| deg1addlt.f | ⊢ (𝜑 → 𝐹 ∈ 𝐵) |
| deg1addlt.g | ⊢ (𝜑 → 𝐺 ∈ 𝐵) |
| deg1addlt.l | ⊢ (𝜑 → 𝐿 ∈ ℝ*) |
| deg1addlt.1 | ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) |
| deg1addlt.2 | ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) |
| Ref | Expression |
|---|---|
| deg1addlt | ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | deg1addlt.r | . . . . 5 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 2 | deg1addlt.y | . . . . . 6 ⊢ 𝑌 = (Poly1‘𝑅) | |
| 3 | 2 | ply1ring 22235 | . . . . 5 ⊢ (𝑅 ∈ Ring → 𝑌 ∈ Ring) |
| 4 | 1, 3 | syl 17 | . . . 4 ⊢ (𝜑 → 𝑌 ∈ Ring) |
| 5 | deg1addlt.f | . . . 4 ⊢ (𝜑 → 𝐹 ∈ 𝐵) | |
| 6 | deg1addlt.g | . . . 4 ⊢ (𝜑 → 𝐺 ∈ 𝐵) | |
| 7 | deg1addlt.b | . . . . 5 ⊢ 𝐵 = (Base‘𝑌) | |
| 8 | deg1addlt.p | . . . . 5 ⊢ + = (+g‘𝑌) | |
| 9 | 7, 8 | ringacl 20253 | . . . 4 ⊢ ((𝑌 ∈ Ring ∧ 𝐹 ∈ 𝐵 ∧ 𝐺 ∈ 𝐵) → (𝐹 + 𝐺) ∈ 𝐵) |
| 10 | 4, 5, 6, 9 | syl3anc 1380 | . . 3 ⊢ (𝜑 → (𝐹 + 𝐺) ∈ 𝐵) |
| 11 | deg1addlt.d | . . . 4 ⊢ 𝐷 = (deg1‘𝑅) | |
| 12 | 11, 2, 7 | deg1xrcl 26068 | . . 3 ⊢ ((𝐹 + 𝐺) ∈ 𝐵 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 13 | 10, 12 | syl 17 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ∈ ℝ*) |
| 14 | 11, 2, 7 | deg1xrcl 26068 | . . . 4 ⊢ (𝐺 ∈ 𝐵 → (𝐷‘𝐺) ∈ ℝ*) |
| 15 | 6, 14 | syl 17 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) ∈ ℝ*) |
| 16 | 11, 2, 7 | deg1xrcl 26068 | . . . 4 ⊢ (𝐹 ∈ 𝐵 → (𝐷‘𝐹) ∈ ℝ*) |
| 17 | 5, 16 | syl 17 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) ∈ ℝ*) |
| 18 | 15, 17 | ifcld 4503 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) ∈ ℝ*) |
| 19 | deg1addlt.l | . 2 ⊢ (𝜑 → 𝐿 ∈ ℝ*) | |
| 20 | 2, 11, 1, 7, 8, 5, 6 | deg1addle 26087 | . 2 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) ≤ if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹))) |
| 21 | deg1addlt.1 | . . 3 ⊢ (𝜑 → (𝐷‘𝐹) < 𝐿) | |
| 22 | deg1addlt.2 | . . 3 ⊢ (𝜑 → (𝐷‘𝐺) < 𝐿) | |
| 23 | xrmaxlt 13128 | . . . 4 ⊢ (((𝐷‘𝐹) ∈ ℝ* ∧ (𝐷‘𝐺) ∈ ℝ* ∧ 𝐿 ∈ ℝ*) → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) | |
| 24 | 17, 15, 19, 23 | syl3anc 1380 | . . 3 ⊢ (𝜑 → (if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿 ↔ ((𝐷‘𝐹) < 𝐿 ∧ (𝐷‘𝐺) < 𝐿))) |
| 25 | 21, 22, 24 | mpbir2and 720 | . 2 ⊢ (𝜑 → if((𝐷‘𝐹) ≤ (𝐷‘𝐺), (𝐷‘𝐺), (𝐷‘𝐹)) < 𝐿) |
| 26 | 13, 18, 19, 20, 25 | xrlelttrd 13106 | 1 ⊢ (𝜑 → (𝐷‘(𝐹 + 𝐺)) < 𝐿) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ifcif 4456 class class class wbr 5074 ‘cfv 6488 (class class class)co 7359 ℝ*cxr 11174 < clt 11175 ≤ cle 11176 Basecbs 17174 +gcplusg 17215 Ringcrg 20208 Poly1cpl1 22165 deg1cdg1 26040 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-10 2154 ax-11 2170 ax-12 2191 ax-ext 2713 ax-rep 5201 ax-sep 5220 ax-nul 5230 ax-pow 5296 ax-pr 5364 ax-un 7681 ax-cnex 11090 ax-resscn 11091 ax-1cn 11092 ax-icn 11093 ax-addcl 11094 ax-addrcl 11095 ax-mulcl 11096 ax-mulrcl 11097 ax-mulcom 11098 ax-addass 11099 ax-mulass 11100 ax-distr 11101 ax-i2m1 11102 ax-1ne0 11103 ax-1rid 11104 ax-rnegex 11105 ax-rrecex 11106 ax-cnre 11107 ax-pre-lttri 11108 ax-pre-lttrn 11109 ax-pre-ltadd 11110 ax-pre-mulgt0 11111 ax-pre-sup 11112 ax-addf 11113 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-or 855 df-3or 1094 df-3an 1095 df-tru 1551 df-fal 1561 df-ex 1788 df-nf 1792 df-sb 2075 df-mo 2545 df-eu 2575 df-clab 2720 df-cleq 2733 df-clel 2816 df-nfc 2890 df-ne 2937 df-nel 3041 df-ral 3056 df-rex 3066 df-rmo 3346 df-reu 3347 df-rab 3394 df-v 3435 df-sbc 3725 df-csb 3833 df-dif 3887 df-un 3889 df-in 3891 df-ss 3901 df-pss 3904 df-nul 4264 df-if 4457 df-pw 4533 df-sn 4558 df-pr 4560 df-tp 4562 df-op 4564 df-uni 4841 df-int 4880 df-iun 4925 df-iin 4926 df-br 5075 df-opab 5137 df-mpt 5156 df-tr 5182 df-id 5515 df-eprel 5520 df-po 5528 df-so 5529 df-fr 5573 df-se 5574 df-we 5575 df-xp 5626 df-rel 5627 df-cnv 5628 df-co 5629 df-dm 5630 df-rn 5631 df-res 5632 df-ima 5633 df-pred 6255 df-ord 6316 df-on 6317 df-lim 6318 df-suc 6319 df-iota 6444 df-fun 6490 df-fn 6491 df-f 6492 df-f1 6493 df-fo 6494 df-f1o 6495 df-fv 6496 df-isom 6497 df-riota 7316 df-ov 7362 df-oprab 7363 df-mpo 7364 df-of 7623 df-ofr 7624 df-om 7810 df-1st 7933 df-2nd 7934 df-supp 8103 df-frecs 8224 df-wrecs 8255 df-recs 8304 df-rdg 8343 df-1o 8399 df-2o 8400 df-er 8637 df-map 8769 df-pm 8770 df-ixp 8840 df-en 8888 df-dom 8889 df-sdom 8890 df-fin 8891 df-fsupp 9269 df-sup 9349 df-oi 9419 df-card 9858 df-pnf 11177 df-mnf 11178 df-xr 11179 df-ltxr 11180 df-le 11181 df-sub 11375 df-neg 11376 df-nn 12170 df-2 12239 df-3 12240 df-4 12241 df-5 12242 df-6 12243 df-7 12244 df-8 12245 df-9 12246 df-n0 12433 df-z 12520 df-dec 12640 df-uz 12784 df-fz 13457 df-fzo 13604 df-seq 13959 df-hash 14288 df-struct 17112 df-sets 17129 df-slot 17147 df-ndx 17159 df-base 17175 df-ress 17196 df-plusg 17228 df-mulr 17229 df-starv 17230 df-sca 17231 df-vsca 17232 df-ip 17233 df-tset 17234 df-ple 17235 df-ds 17237 df-unif 17238 df-hom 17239 df-cco 17240 df-0g 17399 df-gsum 17400 df-prds 17405 df-pws 17407 df-mre 17543 df-mrc 17544 df-acs 17546 df-mgm 18603 df-sgrp 18682 df-mnd 18698 df-mhm 18746 df-submnd 18747 df-grp 18907 df-minusg 18908 df-mulg 19039 df-subg 19094 df-ghm 19183 df-cntz 19286 df-cmn 19751 df-abl 19752 df-mgp 20116 df-rng 20128 df-ur 20157 df-ring 20210 df-cring 20211 df-subrng 20521 df-subrg 20545 df-cnfld 21351 df-psr 21887 df-mpl 21889 df-opsr 21891 df-psr1 22168 df-ply1 22170 df-mdeg 26041 df-deg1 26042 |
| This theorem is referenced by: q1pdir 33696 rtelextdg2lem 33920 |
| Copyright terms: Public domain | W3C validator |