Theorem coe11 26226

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.

Step	Hyp	Ref	Expression
1		fveq2 6842	. . 3 ⊢ (𝐹 = 𝐺 → (coeff‘𝐹) = (coeff‘𝐺))
2		coefv0.1	. . 3 ⊢ 𝐴 = (coeff‘𝐹)
3		coeadd.2	. . 3 ⊢ 𝐵 = (coeff‘𝐺)
4	1, 2, 3	3eqtr4g 2797	. 2 ⊢ (𝐹 = 𝐺 → 𝐴 = 𝐵)
5		simp3 1139	. . . . . . . . . . 11 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐴 = 𝐵)
6	5	cnveqd 5832	. . . . . . . . . 10 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → ◡𝐴 = ◡𝐵)
7	6	imaeq1d 6026	. . . . . . . . 9 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (◡𝐴 “ (ℂ ∖ {0})) = (◡𝐵 “ (ℂ ∖ {0})))
8	7	supeq1d 9361	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ) = sup((◡𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
9	2	dgrval 26201	. . . . . . . . 9 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ))
10	9	3ad2ant1 1134	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐹) = sup((◡𝐴 “ (ℂ ∖ {0})), ℕ0, < ))
11	3	dgrval 26201	. . . . . . . . 9 ⊢ (𝐺 ∈ (Poly‘𝑆) → (deg‘𝐺) = sup((◡𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
12	11	3ad2ant2 1135	. . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐺) = sup((◡𝐵 “ (ℂ ∖ {0})), ℕ0, < ))
13	8, 10, 12	3eqtr4d 2782	. . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (deg‘𝐹) = (deg‘𝐺))
14	13	oveq2d 7384	. . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (0...(deg‘𝐹)) = (0...(deg‘𝐺)))
15		simpl3 1195	. . . . . . . 8 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → 𝐴 = 𝐵)
16	15	fveq1d 6844	. . . . . . 7 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → (𝐴‘𝑘) = (𝐵‘𝑘))
17	16	oveq1d 7383	. . . . . 6 ⊢ (((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) ∧ 𝑘 ∈ (0...(deg‘𝐹))) → ((𝐴‘𝑘) · (𝑧↑𝑘)) = ((𝐵‘𝑘) · (𝑧↑𝑘)))
18	14, 17	sumeq12dv 15641	. . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴‘𝑘) · (𝑧↑𝑘)) = Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵‘𝑘) · (𝑧↑𝑘)))
19	18	mpteq2dv 5194	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴‘𝑘) · (𝑧↑𝑘))) = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵‘𝑘) · (𝑧↑𝑘))))
20		eqid 2737	. . . . . 6 ⊢ (deg‘𝐹) = (deg‘𝐹)
21	2, 20	coeid 26211	. . . . 5 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴‘𝑘) · (𝑧↑𝑘))))
22	21	3ad2ant1 1134	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐹 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐹))((𝐴‘𝑘) · (𝑧↑𝑘))))
23		eqid 2737	. . . . . 6 ⊢ (deg‘𝐺) = (deg‘𝐺)
24	3, 23	coeid 26211	. . . . 5 ⊢ (𝐺 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵‘𝑘) · (𝑧↑𝑘))))
25	24	3ad2ant2 1135	. . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...(deg‘𝐺))((𝐵‘𝑘) · (𝑧↑𝑘))))
26	19, 22, 25	3eqtr4d 2782	. . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆) ∧ 𝐴 = 𝐵) → 𝐹 = 𝐺)
27	26	3expia 1122	. 2 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐴 = 𝐵 → 𝐹 = 𝐺))
28	4, 27	impbid2 226	1 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝐺 ∈ (Poly‘𝑆)) → (𝐹 = 𝐺 ↔ 𝐴 = 𝐵))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1087   = wceq 1542   ∈ wcel 2114   ∖ cdif 3900  {csn 4582   ↦ cmpt 5181  ^◡ccnv 5631   “ cima 5635  ‘cfv 6500  (class class class)co 7368  supcsup 9355  ℂcc 11036  0cc0 11038   · cmul 11043   < clt 11178  ℕ₀cn0 12413  ...cfz 13435  ↑cexp 13996  Σcsu 15621  Polycply 26157  coeffccoe 26159  degcdgr 26160

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 2709  ax-rep 5226  ax-sep 5243  ax-nul 5253  ax-pow 5312  ax-pr 5379  ax-un 7690  ax-inf2 9562  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

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 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3352  df-reu 3353  df-rab 3402  df-v 3444  df-sbc 3743  df-csb 3852  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-pss 3923  df-nul 4288  df-if 4482  df-pw 4558  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-int 4905  df-iun 4950  df-br 5101  df-opab 5163  df-mpt 5182  df-tr 5208  df-id 5527  df-eprel 5532  df-po 5540  df-so 5541  df-fr 5585  df-se 5586  df-we 5587  df-xp 5638  df-rel 5639  df-cnv 5640  df-co 5641  df-dm 5642  df-rn 5643  df-res 5644  df-ima 5645  df-pred 6267  df-ord 6328  df-on 6329  df-lim 6330  df-suc 6331  df-iota 6456  df-fun 6502  df-fn 6503  df-f 6504  df-f1 6505  df-fo 6506  df-f1o 6507  df-fv 6508  df-isom 6509  df-riota 7325  df-ov 7371  df-oprab 7372  df-mpo 7373  df-of 7632  df-om 7819  df-1st 7943  df-2nd 7944  df-frecs 8233  df-wrecs 8264  df-recs 8313  df-rdg 8351  df-1o 8407  df-er 8645  df-map 8777  df-pm 8778  df-en 8896  df-dom 8897  df-sdom 8898  df-fin 8899  df-sup 9357  df-inf 9358  df-oi 9427  df-card 9863  df-pnf 11180  df-mnf 11181  df-xr 11182  df-ltxr 11183  df-le 11184  df-sub 11378  df-neg 11379  df-div 11807  df-nn 12158  df-2 12220  df-3 12221  df-n0 12414  df-z 12501  df-uz 12764  df-rp 12918  df-fz 13436  df-fzo 13583  df-fl 13724  df-seq 13937  df-exp 13997  df-hash 14266  df-cj 15034  df-re 15035  df-im 15036  df-sqrt 15170  df-abs 15171  df-clim 15423  df-rlim 15424  df-sum 15622  df-0p 25639  df-ply 26161  df-coe 26163  df-dgr 26164

This theorem is referenced by: (None)