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

Theorem coe11 23930
Description: The coefficient function is one-to-one, so if the coefficients are equal then the functions are equal and vice-versa. (Contributed by Mario Carneiro, 24-Jul-2014.) (Revised by Mario Carneiro, 23-Aug-2014.)
Hypotheses
Ref Expression
coefv0.1 𝐴 = (coeff‘𝐹)
coeadd.2 𝐵 = (coeff‘𝐺)
Assertion
Ref Expression
coe11 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 𝐺𝐴 = 𝐵))

Proof of Theorem coe11
Dummy variables 𝑘 𝑧 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 fveq2 6153 . . 3 (𝐹 = 𝐺 → (coeff‘𝐹) = (coeff‘𝐺))
2 coefv0.1 . . 3 𝐴 = (coeff‘𝐹)
3 coeadd.2 . . 3 𝐵 = (coeff‘𝐺)
41, 2, 33eqtr4g 2680 . 2 (𝐹 = 𝐺𝐴 = 𝐵)
5 simp3 1061 . . . . . . . . . . 11 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
65cnveqd 5263 . . . . . . . . . 10 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
76imaeq1d 5429 . . . . . . . . 9 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (𝐴 “ (ℂ ∖ {0})) = (𝐵 “ (ℂ ∖ {0})))
87supeq1d 8304 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → sup((𝐴 “ (ℂ ∖ {0})), ℕ0, < ) = sup((𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
92dgrval 23905 . . . . . . . . 9 (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((𝐴 “ (ℂ ∖ {0})), ℕ0, < ))
1093ad2ant1 1080 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐹) = sup((𝐴 “ (ℂ ∖ {0})), ℕ0, < ))
113dgrval 23905 . . . . . . . . 9 (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) = sup((𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
12113ad2ant2 1081 . . . . . . . 8 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐺) = sup((𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
138, 10, 123eqtr4d 2665 . . . . . . 7 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐹) = (deg‘𝐺))
1413oveq2d 6626 . . . . . 6 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (0...(deg‘𝐹)) = (0...(deg‘𝐺)))
15 simpl3 1064 . . . . . . . 8 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → 𝐴 = 𝐵)
1615fveq1d 6155 . . . . . . 7 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → (𝐴𝑘) = (𝐵𝑘))
1716oveq1d 6625 . . . . . 6 (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → ((𝐴𝑘) · (𝑧𝑘)) = ((𝐵𝑘) · (𝑧𝑘)))
1814, 17sumeq12dv 14378 . . . . 5 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴𝑘) · (𝑧𝑘)) = Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵𝑘) · (𝑧𝑘)))
1918mpteq2dv 4710 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴𝑘) · (𝑧𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵𝑘) · (𝑧𝑘))))
20 eqid 2621 . . . . . 6 (deg‘𝐹) = (deg‘𝐹)
212, 20coeid 23915 . . . . 5 (𝐹 ∈ (Poly‘𝑆) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴𝑘) · (𝑧𝑘))))
22213ad2ant1 1080 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴𝑘) · (𝑧𝑘))))
23 eqid 2621 . . . . . 6 (deg‘𝐺) = (deg‘𝐺)
243, 23coeid 23915 . . . . 5 (𝐺 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵𝑘) · (𝑧𝑘))))
25243ad2ant2 1081 . . . 4 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵𝑘) · (𝑧𝑘))))
2619, 22, 253eqtr4d 2665 . . 3 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐹 = 𝐺)
27263expia 1264 . 2 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐴 = 𝐵𝐹 = 𝐺))
284, 27impbid2 216 1 ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 𝐺𝐴 = 𝐵))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 196  wa 384  w3a 1036   = wceq 1480  wcel 1987  cdif 3556  {csn 4153  cmpt 4678  ccnv 5078  cima 5082  cfv 5852  (class class class)co 6610  supcsup 8298  cc 9886  0cc0 9888   · cmul 9893   < clt 10026  0cn0 11244  ...cfz 12276  cexp 12808  Σcsu 14358  Polycply 23861  coeffccoe 23863  degcdgr 23864
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1719  ax-4 1734  ax-5 1836  ax-6 1885  ax-7 1932  ax-8 1989  ax-9 1996  ax-10 2016  ax-11 2031  ax-12 2044  ax-13 2245  ax-ext 2601  ax-rep 4736  ax-sep 4746  ax-nul 4754  ax-pow 4808  ax-pr 4872  ax-un 6909  ax-inf2 8490  ax-cnex 9944  ax-resscn 9945  ax-1cn 9946  ax-icn 9947  ax-addcl 9948  ax-addrcl 9949  ax-mulcl 9950  ax-mulrcl 9951  ax-mulcom 9952  ax-addass 9953  ax-mulass 9954  ax-distr 9955  ax-i2m1 9956  ax-1ne0 9957  ax-1rid 9958  ax-rnegex 9959  ax-rrecex 9960  ax-cnre 9961  ax-pre-lttri 9962  ax-pre-lttrn 9963  ax-pre-ltadd 9964  ax-pre-mulgt0 9965  ax-pre-sup 9966  ax-addf 9967
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3or 1037  df-3an 1038  df-tru 1483  df-fal 1486  df-ex 1702  df-nf 1707  df-sb 1878  df-eu 2473  df-mo 2474  df-clab 2608  df-cleq 2614  df-clel 2617  df-nfc 2750  df-ne 2791  df-nel 2894  df-ral 2912  df-rex 2913  df-reu 2914  df-rmo 2915  df-rab 2916  df-v 3191  df-sbc 3422  df-csb 3519  df-dif 3562  df-un 3564  df-in 3566  df-ss 3573  df-pss 3575  df-nul 3897  df-if 4064  df-pw 4137  df-sn 4154  df-pr 4156  df-tp 4158  df-op 4160  df-uni 4408  df-int 4446  df-iun 4492  df-br 4619  df-opab 4679  df-mpt 4680  df-tr 4718  df-eprel 4990  df-id 4994  df-po 5000  df-so 5001  df-fr 5038  df-se 5039  df-we 5040  df-xp 5085  df-rel 5086  df-cnv 5087  df-co 5088  df-dm 5089  df-rn 5090  df-res 5091  df-ima 5092  df-pred 5644  df-ord 5690  df-on 5691  df-lim 5692  df-suc 5693  df-iota 5815  df-fun 5854  df-fn 5855  df-f 5856  df-f1 5857  df-fo 5858  df-f1o 5859  df-fv 5860  df-isom 5861  df-riota 6571  df-ov 6613  df-oprab 6614  df-mpt2 6615  df-of 6857  df-om 7020  df-1st 7120  df-2nd 7121  df-wrecs 7359  df-recs 7420  df-rdg 7458  df-1o 7512  df-oadd 7516  df-er 7694  df-map 7811  df-pm 7812  df-en 7908  df-dom 7909  df-sdom 7910  df-fin 7911  df-sup 8300  df-inf 8301  df-oi 8367  df-card 8717  df-pnf 10028  df-mnf 10029  df-xr 10030  df-ltxr 10031  df-le 10032  df-sub 10220  df-neg 10221  df-div 10637  df-nn 10973  df-2 11031  df-3 11032  df-n0 11245  df-z 11330  df-uz 11640  df-rp 11785  df-fz 12277  df-fzo 12415  df-fl 12541  df-seq 12750  df-exp 12809  df-hash 13066  df-cj 13781  df-re 13782  df-im 13783  df-sqrt 13917  df-abs 13918  df-clim 14161  df-rlim 14162  df-sum 14359  df-0p 23360  df-ply 23865  df-coe 23867  df-dgr 23868
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator