Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > coecj | Structured version Visualization version GIF version |
Description: Double conjugation of a polynomial causes the coefficients to be conjugated. (Contributed by Mario Carneiro, 24-Jul-2014.) |
Ref | Expression |
---|---|
plycj.1 | ⊢ 𝑁 = (deg‘𝐹) |
plycj.2 | ⊢ 𝐺 = ((∗ ∘ 𝐹) ∘ ∗) |
coecj.3 | ⊢ 𝐴 = (coeff‘𝐹) |
Ref | Expression |
---|---|
coecj | ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐺) = (∗ ∘ 𝐴)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | plycj.1 | . . 3 ⊢ 𝑁 = (deg‘𝐹) | |
2 | plycj.2 | . . 3 ⊢ 𝐺 = ((∗ ∘ 𝐹) ∘ ∗) | |
3 | cjcl 14464 | . . . 4 ⊢ (𝑥 ∈ ℂ → (∗‘𝑥) ∈ ℂ) | |
4 | 3 | adantl 484 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑥 ∈ ℂ) → (∗‘𝑥) ∈ ℂ) |
5 | plyssc 24790 | . . . 4 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) | |
6 | 5 | sseli 3963 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ)) |
7 | 1, 2, 4, 6 | plycj 24867 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ)) |
8 | dgrcl 24823 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) | |
9 | 1, 8 | eqeltrid 2917 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0) |
10 | cjf 14463 | . . 3 ⊢ ∗:ℂ⟶ℂ | |
11 | coecj.3 | . . . 4 ⊢ 𝐴 = (coeff‘𝐹) | |
12 | 11 | coef3 24822 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶ℂ) |
13 | fco 6531 | . . 3 ⊢ ((∗:ℂ⟶ℂ ∧ 𝐴:ℕ0⟶ℂ) → (∗ ∘ 𝐴):ℕ0⟶ℂ) | |
14 | 10, 12, 13 | sylancr 589 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∗ ∘ 𝐴):ℕ0⟶ℂ) |
15 | fvco3 6760 | . . . . . . . . 9 ⊢ ((𝐴:ℕ0⟶ℂ ∧ 𝑘 ∈ ℕ0) → ((∗ ∘ 𝐴)‘𝑘) = (∗‘(𝐴‘𝑘))) | |
16 | 12, 15 | sylan 582 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((∗ ∘ 𝐴)‘𝑘) = (∗‘(𝐴‘𝑘))) |
17 | cj0 14517 | . . . . . . . . . 10 ⊢ (∗‘0) = 0 | |
18 | 17 | eqcomi 2830 | . . . . . . . . 9 ⊢ 0 = (∗‘0) |
19 | 18 | a1i 11 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → 0 = (∗‘0)) |
20 | 16, 19 | eqeq12d 2837 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) = 0 ↔ (∗‘(𝐴‘𝑘)) = (∗‘0))) |
21 | 12 | ffvelrnda 6851 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ) |
22 | 0cnd 10634 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → 0 ∈ ℂ) | |
23 | cj11 14521 | . . . . . . . 8 ⊢ (((𝐴‘𝑘) ∈ ℂ ∧ 0 ∈ ℂ) → ((∗‘(𝐴‘𝑘)) = (∗‘0) ↔ (𝐴‘𝑘) = 0)) | |
24 | 21, 22, 23 | syl2anc 586 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((∗‘(𝐴‘𝑘)) = (∗‘0) ↔ (𝐴‘𝑘) = 0)) |
25 | 20, 24 | bitrd 281 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) = 0 ↔ (𝐴‘𝑘) = 0)) |
26 | 25 | necon3bid 3060 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) ≠ 0 ↔ (𝐴‘𝑘) ≠ 0)) |
27 | 11, 1 | dgrub2 24825 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) |
28 | plyco0 24782 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) | |
29 | 9, 12, 28 | syl2anc 586 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) |
30 | 27, 29 | mpbid 234 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
31 | 30 | r19.21bi 3208 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
32 | 26, 31 | sylbid 242 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
33 | 32 | ralrimiva 3182 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
34 | plyco0 24782 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (∗ ∘ 𝐴):ℕ0⟶ℂ) → (((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) | |
35 | 9, 14, 34 | syl2anc 586 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) |
36 | 33, 35 | mpbird 259 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0}) |
37 | 1, 2, 11 | plycjlem 24866 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((∗ ∘ 𝐴)‘𝑘) · (𝑧↑𝑘)))) |
38 | 7, 9, 14, 36, 37 | coeeq 24817 | 1 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐺) = (∗ ∘ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 ≠ wne 3016 ∀wral 3138 {csn 4567 class class class wbr 5066 “ cima 5558 ∘ ccom 5559 ⟶wf 6351 ‘cfv 6355 (class class class)co 7156 ℂcc 10535 0cc0 10537 1c1 10538 + caddc 10540 ≤ cle 10676 ℕ0cn0 11898 ℤ≥cuz 12244 ∗ccj 14455 Polycply 24774 coeffccoe 24776 degcdgr 24777 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 ax-inf2 9104 ax-cnex 10593 ax-resscn 10594 ax-1cn 10595 ax-icn 10596 ax-addcl 10597 ax-addrcl 10598 ax-mulcl 10599 ax-mulrcl 10600 ax-mulcom 10601 ax-addass 10602 ax-mulass 10603 ax-distr 10604 ax-i2m1 10605 ax-1ne0 10606 ax-1rid 10607 ax-rnegex 10608 ax-rrecex 10609 ax-cnre 10610 ax-pre-lttri 10611 ax-pre-lttrn 10612 ax-pre-ltadd 10613 ax-pre-mulgt0 10614 ax-pre-sup 10615 ax-addf 10616 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1084 df-3an 1085 df-tru 1540 df-fal 1550 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-nel 3124 df-ral 3143 df-rex 3144 df-reu 3145 df-rmo 3146 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-pss 3954 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-tp 4572 df-op 4574 df-uni 4839 df-int 4877 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-tr 5173 df-id 5460 df-eprel 5465 df-po 5474 df-so 5475 df-fr 5514 df-se 5515 df-we 5516 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-pred 6148 df-ord 6194 df-on 6195 df-lim 6196 df-suc 6197 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-isom 6364 df-riota 7114 df-ov 7159 df-oprab 7160 df-mpo 7161 df-of 7409 df-om 7581 df-1st 7689 df-2nd 7690 df-wrecs 7947 df-recs 8008 df-rdg 8046 df-1o 8102 df-oadd 8106 df-er 8289 df-map 8408 df-pm 8409 df-en 8510 df-dom 8511 df-sdom 8512 df-fin 8513 df-sup 8906 df-inf 8907 df-oi 8974 df-card 9368 df-pnf 10677 df-mnf 10678 df-xr 10679 df-ltxr 10680 df-le 10681 df-sub 10872 df-neg 10873 df-div 11298 df-nn 11639 df-2 11701 df-3 11702 df-n0 11899 df-z 11983 df-uz 12245 df-rp 12391 df-fz 12894 df-fzo 13035 df-fl 13163 df-seq 13371 df-exp 13431 df-hash 13692 df-cj 14458 df-re 14459 df-im 14460 df-sqrt 14594 df-abs 14595 df-clim 14845 df-rlim 14846 df-sum 15043 df-0p 24271 df-ply 24778 df-coe 24780 df-dgr 24781 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |