MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  dgradd2 Structured version   Visualization version   GIF version

Theorem dgradd2 24223
Description: The degree of a sum of polynomials of unequal degrees is the degree of the larger polynomial. (Contributed by Mario Carneiro, 24-Jul-2014.)
Hypotheses
Ref Expression
dgradd.1 𝑀 = (deg‘𝐹)
dgradd.2 𝑁 = (deg‘𝐺)
Assertion
Ref Expression
dgradd2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) = 𝑁)

Proof of Theorem dgradd2
StepHypRef Expression
1 plyaddcl 24175 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹𝑓 + 𝐺) ∈ (Poly‘ℂ))
213adant3 1127 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (𝐹𝑓 + 𝐺) ∈ (Poly‘ℂ))
3 dgrcl 24188 . . . . 5 ((𝐹𝑓 + 𝐺) ∈ (Poly‘ℂ) → (deg‘(𝐹𝑓 + 𝐺)) ∈ ℕ0)
42, 3syl 17 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) ∈ ℕ0)
54nn0red 11544 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) ∈ ℝ)
6 dgradd.2 . . . . . . 7 𝑁 = (deg‘𝐺)
7 dgrcl 24188 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) ∈ ℕ0)
86, 7syl5eqel 2843 . . . . . 6 (𝐺 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0)
983ad2ant2 1129 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑁 ∈ ℕ0)
109nn0red 11544 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑁 ∈ ℝ)
11 dgradd.1 . . . . . . 7 𝑀 = (deg‘𝐹)
12 dgrcl 24188 . . . . . . 7 (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0)
1311, 12syl5eqel 2843 . . . . . 6 (𝐹 ∈ (Poly‘𝑆) → 𝑀 ∈ ℕ0)
14133ad2ant1 1128 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑀 ∈ ℕ0)
1514nn0red 11544 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑀 ∈ ℝ)
1610, 15ifcld 4275 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → if(𝑀𝑁, 𝑁, 𝑀) ∈ ℝ)
1711, 6dgradd 24222 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (deg‘(𝐹𝑓 + 𝐺)) ≤ if(𝑀𝑁, 𝑁, 𝑀))
18173adant3 1127 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) ≤ if(𝑀𝑁, 𝑁, 𝑀))
1910leidd 10786 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑁𝑁)
20 simp3 1133 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑀 < 𝑁)
2115, 10, 20ltled 10377 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑀𝑁)
22 breq1 4807 . . . . 5 (𝑁 = if(𝑀𝑁, 𝑁, 𝑀) → (𝑁𝑁 ↔ if(𝑀𝑁, 𝑁, 𝑀) ≤ 𝑁))
23 breq1 4807 . . . . 5 (𝑀 = if(𝑀𝑁, 𝑁, 𝑀) → (𝑀𝑁 ↔ if(𝑀𝑁, 𝑁, 𝑀) ≤ 𝑁))
2422, 23ifboth 4268 . . . 4 ((𝑁𝑁𝑀𝑁) → if(𝑀𝑁, 𝑁, 𝑀) ≤ 𝑁)
2519, 21, 24syl2anc 696 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → if(𝑀𝑁, 𝑁, 𝑀) ≤ 𝑁)
265, 16, 10, 18, 25letrd 10386 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) ≤ 𝑁)
27 eqid 2760 . . . . . . . 8 (coeff‘𝐹) = (coeff‘𝐹)
28 eqid 2760 . . . . . . . 8 (coeff‘𝐺) = (coeff‘𝐺)
2927, 28coeadd 24206 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (coeff‘(𝐹𝑓 + 𝐺)) = ((coeff‘𝐹) ∘𝑓 + (coeff‘𝐺)))
30293adant3 1127 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (coeff‘(𝐹𝑓 + 𝐺)) = ((coeff‘𝐹) ∘𝑓 + (coeff‘𝐺)))
3130fveq1d 6354 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘(𝐹𝑓 + 𝐺))‘𝑁) = (((coeff‘𝐹) ∘𝑓 + (coeff‘𝐺))‘𝑁))
3227coef3 24187 . . . . . . . . 9 (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐹):ℕ0⟶ℂ)
33323ad2ant1 1128 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (coeff‘𝐹):ℕ0⟶ℂ)
34 ffn 6206 . . . . . . . 8 ((coeff‘𝐹):ℕ0⟶ℂ → (coeff‘𝐹) Fn ℕ0)
3533, 34syl 17 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (coeff‘𝐹) Fn ℕ0)
3628coef3 24187 . . . . . . . . 9 (𝐺 ∈ (Poly‘𝑆) → (coeff‘𝐺):ℕ0⟶ℂ)
37363ad2ant2 1129 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (coeff‘𝐺):ℕ0⟶ℂ)
38 ffn 6206 . . . . . . . 8 ((coeff‘𝐺):ℕ0⟶ℂ → (coeff‘𝐺) Fn ℕ0)
3937, 38syl 17 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (coeff‘𝐺) Fn ℕ0)
40 nn0ex 11490 . . . . . . . 8 0 ∈ V
4140a1i 11 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ℕ0 ∈ V)
42 inidm 3965 . . . . . . 7 (ℕ0 ∩ ℕ0) = ℕ0
4315, 10ltnled 10376 . . . . . . . . . 10 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (𝑀 < 𝑁 ↔ ¬ 𝑁𝑀))
4420, 43mpbid 222 . . . . . . . . 9 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ¬ 𝑁𝑀)
45 simp1 1131 . . . . . . . . . . 11 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝐹 ∈ (Poly‘𝑆))
4627, 11dgrub 24189 . . . . . . . . . . . 12 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑁 ∈ ℕ0 ∧ ((coeff‘𝐹)‘𝑁) ≠ 0) → 𝑁𝑀)
47463expia 1115 . . . . . . . . . . 11 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑁 ∈ ℕ0) → (((coeff‘𝐹)‘𝑁) ≠ 0 → 𝑁𝑀))
4845, 9, 47syl2anc 696 . . . . . . . . . 10 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (((coeff‘𝐹)‘𝑁) ≠ 0 → 𝑁𝑀))
4948necon1bd 2950 . . . . . . . . 9 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (¬ 𝑁𝑀 → ((coeff‘𝐹)‘𝑁) = 0))
5044, 49mpd 15 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘𝐹)‘𝑁) = 0)
5150adantr 472 . . . . . . 7 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) ∧ 𝑁 ∈ ℕ0) → ((coeff‘𝐹)‘𝑁) = 0)
52 eqidd 2761 . . . . . . 7 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) ∧ 𝑁 ∈ ℕ0) → ((coeff‘𝐺)‘𝑁) = ((coeff‘𝐺)‘𝑁))
5335, 39, 41, 41, 42, 51, 52ofval 7071 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) ∧ 𝑁 ∈ ℕ0) → (((coeff‘𝐹) ∘𝑓 + (coeff‘𝐺))‘𝑁) = (0 + ((coeff‘𝐺)‘𝑁)))
549, 53mpdan 705 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (((coeff‘𝐹) ∘𝑓 + (coeff‘𝐺))‘𝑁) = (0 + ((coeff‘𝐺)‘𝑁)))
5537, 9ffvelrnd 6523 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘𝐺)‘𝑁) ∈ ℂ)
5655addid2d 10429 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (0 + ((coeff‘𝐺)‘𝑁)) = ((coeff‘𝐺)‘𝑁))
5731, 54, 563eqtrd 2798 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘(𝐹𝑓 + 𝐺))‘𝑁) = ((coeff‘𝐺)‘𝑁))
58 simp2 1132 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝐺 ∈ (Poly‘𝑆))
59 0red 10233 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 0 ∈ ℝ)
6014nn0ge0d 11546 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 0 ≤ 𝑀)
6159, 15, 10, 60, 20lelttrd 10387 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 0 < 𝑁)
6261gt0ne0d 10784 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑁 ≠ 0)
636, 28dgreq0 24220 . . . . . . 7 (𝐺 ∈ (Poly‘𝑆) → (𝐺 = 0𝑝 ↔ ((coeff‘𝐺)‘𝑁) = 0))
64 fveq2 6352 . . . . . . . 8 (𝐺 = 0𝑝 → (deg‘𝐺) = (deg‘0𝑝))
65 dgr0 24217 . . . . . . . . 9 (deg‘0𝑝) = 0
6665eqcomi 2769 . . . . . . . 8 0 = (deg‘0𝑝)
6764, 6, 663eqtr4g 2819 . . . . . . 7 (𝐺 = 0𝑝𝑁 = 0)
6863, 67syl6bir 244 . . . . . 6 (𝐺 ∈ (Poly‘𝑆) → (((coeff‘𝐺)‘𝑁) = 0 → 𝑁 = 0))
6968necon3d 2953 . . . . 5 (𝐺 ∈ (Poly‘𝑆) → (𝑁 ≠ 0 → ((coeff‘𝐺)‘𝑁) ≠ 0))
7058, 62, 69sylc 65 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘𝐺)‘𝑁) ≠ 0)
7157, 70eqnetrd 2999 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((coeff‘(𝐹𝑓 + 𝐺))‘𝑁) ≠ 0)
72 eqid 2760 . . . 4 (coeff‘(𝐹𝑓 + 𝐺)) = (coeff‘(𝐹𝑓 + 𝐺))
73 eqid 2760 . . . 4 (deg‘(𝐹𝑓 + 𝐺)) = (deg‘(𝐹𝑓 + 𝐺))
7472, 73dgrub 24189 . . 3 (((𝐹𝑓 + 𝐺) ∈ (Poly‘ℂ) ∧ 𝑁 ∈ ℕ0 ∧ ((coeff‘(𝐹𝑓 + 𝐺))‘𝑁) ≠ 0) → 𝑁 ≤ (deg‘(𝐹𝑓 + 𝐺)))
752, 9, 71, 74syl3anc 1477 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → 𝑁 ≤ (deg‘(𝐹𝑓 + 𝐺)))
765, 10letri3d 10371 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → ((deg‘(𝐹𝑓 + 𝐺)) = 𝑁 ↔ ((deg‘(𝐹𝑓 + 𝐺)) ≤ 𝑁𝑁 ≤ (deg‘(𝐹𝑓 + 𝐺)))))
7726, 75, 76mpbir2and 995 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝑀 < 𝑁) → (deg‘(𝐹𝑓 + 𝐺)) = 𝑁)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 383  w3a 1072   = wceq 1632  wcel 2139  wne 2932  Vcvv 3340  ifcif 4230   class class class wbr 4804   Fn wfn 6044  wf 6045  cfv 6049  (class class class)co 6813  𝑓 cof 7060  cc 10126  cr 10127  0cc0 10128   + caddc 10131   < clt 10266  cle 10267  0cn0 11484  0𝑝c0p 23635  Polycply 24139  coeffccoe 24141  degcdgr 24142
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-8 2141  ax-9 2148  ax-10 2168  ax-11 2183  ax-12 2196  ax-13 2391  ax-ext 2740  ax-rep 4923  ax-sep 4933  ax-nul 4941  ax-pow 4992  ax-pr 5055  ax-un 7114  ax-inf2 8711  ax-cnex 10184  ax-resscn 10185  ax-1cn 10186  ax-icn 10187  ax-addcl 10188  ax-addrcl 10189  ax-mulcl 10190  ax-mulrcl 10191  ax-mulcom 10192  ax-addass 10193  ax-mulass 10194  ax-distr 10195  ax-i2m1 10196  ax-1ne0 10197  ax-1rid 10198  ax-rnegex 10199  ax-rrecex 10200  ax-cnre 10201  ax-pre-lttri 10202  ax-pre-lttrn 10203  ax-pre-ltadd 10204  ax-pre-mulgt0 10205  ax-pre-sup 10206  ax-addf 10207
This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-3or 1073  df-3an 1074  df-tru 1635  df-fal 1638  df-ex 1854  df-nf 1859  df-sb 2047  df-eu 2611  df-mo 2612  df-clab 2747  df-cleq 2753  df-clel 2756  df-nfc 2891  df-ne 2933  df-nel 3036  df-ral 3055  df-rex 3056  df-reu 3057  df-rmo 3058  df-rab 3059  df-v 3342  df-sbc 3577  df-csb 3675  df-dif 3718  df-un 3720  df-in 3722  df-ss 3729  df-pss 3731  df-nul 4059  df-if 4231  df-pw 4304  df-sn 4322  df-pr 4324  df-tp 4326  df-op 4328  df-uni 4589  df-int 4628  df-iun 4674  df-br 4805  df-opab 4865  df-mpt 4882  df-tr 4905  df-id 5174  df-eprel 5179  df-po 5187  df-so 5188  df-fr 5225  df-se 5226  df-we 5227  df-xp 5272  df-rel 5273  df-cnv 5274  df-co 5275  df-dm 5276  df-rn 5277  df-res 5278  df-ima 5279  df-pred 5841  df-ord 5887  df-on 5888  df-lim 5889  df-suc 5890  df-iota 6012  df-fun 6051  df-fn 6052  df-f 6053  df-f1 6054  df-fo 6055  df-f1o 6056  df-fv 6057  df-isom 6058  df-riota 6774  df-ov 6816  df-oprab 6817  df-mpt2 6818  df-of 7062  df-om 7231  df-1st 7333  df-2nd 7334  df-wrecs 7576  df-recs 7637  df-rdg 7675  df-1o 7729  df-oadd 7733  df-er 7911  df-map 8025  df-pm 8026  df-en 8122  df-dom 8123  df-sdom 8124  df-fin 8125  df-sup 8513  df-inf 8514  df-oi 8580  df-card 8955  df-pnf 10268  df-mnf 10269  df-xr 10270  df-ltxr 10271  df-le 10272  df-sub 10460  df-neg 10461  df-div 10877  df-nn 11213  df-2 11271  df-3 11272  df-n0 11485  df-z 11570  df-uz 11880  df-rp 12026  df-fz 12520  df-fzo 12660  df-fl 12787  df-seq 12996  df-exp 13055  df-hash 13312  df-cj 14038  df-re 14039  df-im 14040  df-sqrt 14174  df-abs 14175  df-clim 14418  df-rlim 14419  df-sum 14616  df-0p 23636  df-ply 24143  df-coe 24145  df-dgr 24146
This theorem is referenced by:  dgrcolem2  24229  plyremlem  24258
  Copyright terms: Public domain W3C validator