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 13693 | . . . 4 ⊢ (𝑥 ∈ ℂ → (∗‘𝑥) ∈ ℂ) | |
4 | 3 | adantl 481 | . . 3 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑥 ∈ ℂ) → (∗‘𝑥) ∈ ℂ) |
5 | plyssc 23760 | . . . 4 ⊢ (Poly‘𝑆) ⊆ (Poly‘ℂ) | |
6 | 5 | sseli 3564 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐹 ∈ (Poly‘ℂ)) |
7 | 1, 2, 4, 6 | plycj 23837 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐺 ∈ (Poly‘ℂ)) |
8 | dgrcl 23793 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (deg‘𝐹) ∈ ℕ0) | |
9 | 1, 8 | syl5eqel 2692 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝑁 ∈ ℕ0) |
10 | cjf 13692 | . . 3 ⊢ ∗:ℂ⟶ℂ | |
11 | coecj.3 | . . . 4 ⊢ 𝐴 = (coeff‘𝐹) | |
12 | 11 | coef3 23792 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐴:ℕ0⟶ℂ) |
13 | fco 5971 | . . 3 ⊢ ((∗:ℂ⟶ℂ ∧ 𝐴:ℕ0⟶ℂ) → (∗ ∘ 𝐴):ℕ0⟶ℂ) | |
14 | 10, 12, 13 | sylancr 694 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → (∗ ∘ 𝐴):ℕ0⟶ℂ) |
15 | fvco3 6185 | . . . . . . . . 9 ⊢ ((𝐴:ℕ0⟶ℂ ∧ 𝑘 ∈ ℕ0) → ((∗ ∘ 𝐴)‘𝑘) = (∗‘(𝐴‘𝑘))) | |
16 | 12, 15 | sylan 487 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((∗ ∘ 𝐴)‘𝑘) = (∗‘(𝐴‘𝑘))) |
17 | cj0 13746 | . . . . . . . . . 10 ⊢ (∗‘0) = 0 | |
18 | 17 | eqcomi 2619 | . . . . . . . . 9 ⊢ 0 = (∗‘0) |
19 | 18 | a1i 11 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → 0 = (∗‘0)) |
20 | 16, 19 | eqeq12d 2625 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) = 0 ↔ (∗‘(𝐴‘𝑘)) = (∗‘0))) |
21 | 12 | ffvelrnda 6267 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (𝐴‘𝑘) ∈ ℂ) |
22 | 0cnd 9912 | . . . . . . . 8 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → 0 ∈ ℂ) | |
23 | cj11 13750 | . . . . . . . 8 ⊢ (((𝐴‘𝑘) ∈ ℂ ∧ 0 ∈ ℂ) → ((∗‘(𝐴‘𝑘)) = (∗‘0) ↔ (𝐴‘𝑘) = 0)) | |
24 | 21, 22, 23 | syl2anc 691 | . . . . . . 7 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((∗‘(𝐴‘𝑘)) = (∗‘0) ↔ (𝐴‘𝑘) = 0)) |
25 | 20, 24 | bitrd 267 | . . . . . 6 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) = 0 ↔ (𝐴‘𝑘) = 0)) |
26 | 25 | necon3bid 2826 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) ≠ 0 ↔ (𝐴‘𝑘) ≠ 0)) |
27 | 11, 1 | dgrub2 23795 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → (𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0}) |
28 | plyco0 23752 | . . . . . . . 8 ⊢ ((𝑁 ∈ ℕ0 ∧ 𝐴:ℕ0⟶ℂ) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) | |
29 | 9, 12, 28 | syl2anc 691 | . . . . . . 7 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((𝐴 “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) |
30 | 27, 29 | mpbid 221 | . . . . . 6 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∀𝑘 ∈ ℕ0 ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
31 | 30 | r19.21bi 2916 | . . . . 5 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → ((𝐴‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
32 | 26, 31 | sylbid 229 | . . . 4 ⊢ ((𝐹 ∈ (Poly‘𝑆) ∧ 𝑘 ∈ ℕ0) → (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
33 | 32 | ralrimiva 2949 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁)) |
34 | plyco0 23752 | . . . 4 ⊢ ((𝑁 ∈ ℕ0 ∧ (∗ ∘ 𝐴):ℕ0⟶ℂ) → (((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) | |
35 | 9, 14, 34 | syl2anc 691 | . . 3 ⊢ (𝐹 ∈ (Poly‘𝑆) → (((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0} ↔ ∀𝑘 ∈ ℕ0 (((∗ ∘ 𝐴)‘𝑘) ≠ 0 → 𝑘 ≤ 𝑁))) |
36 | 33, 35 | mpbird 246 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → ((∗ ∘ 𝐴) “ (ℤ≥‘(𝑁 + 1))) = {0}) |
37 | 1, 2, 11 | plycjlem 23836 | . 2 ⊢ (𝐹 ∈ (Poly‘𝑆) → 𝐺 = (𝑧 ∈ ℂ ↦ Σ𝑘 ∈ (0...𝑁)(((∗ ∘ 𝐴)‘𝑘) · (𝑧↑𝑘)))) |
38 | 7, 9, 14, 36, 37 | coeeq 23787 | 1 ⊢ (𝐹 ∈ (Poly‘𝑆) → (coeff‘𝐺) = (∗ ∘ 𝐴)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ≠ wne 2780 ∀wral 2896 {csn 4125 class class class wbr 4583 “ cima 5041 ∘ ccom 5042 ⟶wf 5800 ‘cfv 5804 (class class class)co 6549 ℂcc 9813 0cc0 9815 1c1 9816 + caddc 9818 ≤ cle 9954 ℕ0cn0 11169 ℤ≥cuz 11563 ∗ccj 13684 Polycply 23744 coeffccoe 23746 degcdgr 23747 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-inf2 8421 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 ax-pre-sup 9893 ax-addf 9894 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-fal 1481 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-se 4998 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-isom 5813 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-of 6795 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-1o 7447 df-oadd 7451 df-er 7629 df-map 7746 df-pm 7747 df-en 7842 df-dom 7843 df-sdom 7844 df-fin 7845 df-sup 8231 df-inf 8232 df-oi 8298 df-card 8648 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-div 10564 df-nn 10898 df-2 10956 df-3 10957 df-n0 11170 df-z 11255 df-uz 11564 df-rp 11709 df-fz 12198 df-fzo 12335 df-fl 12455 df-seq 12664 df-exp 12723 df-hash 12980 df-cj 13687 df-re 13688 df-im 13689 df-sqrt 13823 df-abs 13824 df-clim 14067 df-rlim 14068 df-sum 14265 df-0p 23243 df-ply 23748 df-coe 23750 df-dgr 23751 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |