Metamath Proof Explorer


Theorem coecjOLD

Description: Obsolete version of coecj as of 22-Sep-2025. Double conjugation of a polynomial causes the coefficients to be conjugated. (Contributed by Mario Carneiro, 24-Jul-2014) (New usage is discouraged.) (Proof modification is discouraged.)

Ref Expression
Hypotheses plycjOLD.1 ⊢ N = deg ⁡ F
plycjOLD.2 ⊢ G = * ∘ F ∘ *
coecjOLD.3 ⊢ A = coeff ⁡ F
Assertion coecjOLD ⊢ F ∈ Poly ⁡ S → coeff ⁡ G = * ∘ A

Proof

Step Hyp Ref Expression
1 plycjOLD.1 ⊢ N = deg ⁡ F
2 plycjOLD.2 ⊢ G = * ∘ F ∘ *
3 coecjOLD.3 ⊢ A = coeff ⁡ F
4 cjcl ⊢ x ∈ ℂ → x ‾ ∈ ℂ
5 4 adantl ⊢ F ∈ Poly ⁡ S ∧ x ∈ ℂ → x ‾ ∈ ℂ
6 plyssc ⊢ Poly ⁡ S ⊆ Poly ⁡ ℂ
7 6 sseli ⊢ F ∈ Poly ⁡ S → F ∈ Poly ⁡ ℂ
8 1 2 5 7 plycjOLD ⊢ F ∈ Poly ⁡ S → G ∈ Poly ⁡ ℂ
9 dgrcl ⊢ F ∈ Poly ⁡ S → deg ⁡ F ∈ ℕ 0
10 1 9 eqeltrid ⊢ F ∈ Poly ⁡ S → N ∈ ℕ 0
11 cjf ⊢ * : ℂ ⟶ ℂ
12 3 coef3 ⊢ F ∈ Poly ⁡ S → A : ℕ 0 ⟶ ℂ
13 fco ⊢ * : ℂ ⟶ ℂ ∧ A : ℕ 0 ⟶ ℂ → * ∘ A : ℕ 0 ⟶ ℂ
14 11 12 13 sylancr ⊢ F ∈ Poly ⁡ S → * ∘ A : ℕ 0 ⟶ ℂ
15 fvco3 ⊢ A : ℕ 0 ⟶ ℂ ∧ k ∈ ℕ 0 → * ∘ A ⁡ k = A ⁡ k ‾
16 12 15 sylan ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → * ∘ A ⁡ k = A ⁡ k ‾
17 cj0 ⊢ 0 ‾ = 0
18 17 eqcomi ⊢ 0 = 0 ‾
19 18 a1i ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → 0 = 0 ‾
20 16 19 eqeq12d ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → * ∘ A ⁡ k = 0 ↔ A ⁡ k ‾ = 0 ‾
21 12 ffvelcdmda ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → A ⁡ k ∈ ℂ
22 0cnd ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → 0 ∈ ℂ
23 cj11 ⊢ A ⁡ k ∈ ℂ ∧ 0 ∈ ℂ → A ⁡ k ‾ = 0 ‾ ↔ A ⁡ k = 0
24 21 22 23 syl2anc ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → A ⁡ k ‾ = 0 ‾ ↔ A ⁡ k = 0
25 20 24 bitrd ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → * ∘ A ⁡ k = 0 ↔ A ⁡ k = 0
26 25 necon3bid ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → * ∘ A ⁡ k ≠ 0 ↔ A ⁡ k ≠ 0
27 3 1 dgrub2 ⊢ F ∈ Poly ⁡ S → A ℤ ≥ N + 1 = 0
28 plyco0 ⊢ N ∈ ℕ 0 ∧ A : ℕ 0 ⟶ ℂ → A ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 A ⁡ k ≠ 0 → k ≤ N
29 10 12 28 syl2anc ⊢ F ∈ Poly ⁡ S → A ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 A ⁡ k ≠ 0 → k ≤ N
30 27 29 mpbid ⊢ F ∈ Poly ⁡ S → ∀ k ∈ ℕ 0 A ⁡ k ≠ 0 → k ≤ N
31 30 r19.21bi ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → A ⁡ k ≠ 0 → k ≤ N
32 26 31 sylbid ⊢ F ∈ Poly ⁡ S ∧ k ∈ ℕ 0 → * ∘ A ⁡ k ≠ 0 → k ≤ N
33 32 ralrimiva ⊢ F ∈ Poly ⁡ S → ∀ k ∈ ℕ 0 * ∘ A ⁡ k ≠ 0 → k ≤ N
34 plyco0 ⊢ N ∈ ℕ 0 ∧ * ∘ A : ℕ 0 ⟶ ℂ → * ∘ A ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 * ∘ A ⁡ k ≠ 0 → k ≤ N
35 10 14 34 syl2anc ⊢ F ∈ Poly ⁡ S → * ∘ A ℤ ≥ N + 1 = 0 ↔ ∀ k ∈ ℕ 0 * ∘ A ⁡ k ≠ 0 → k ≤ N
36 33 35 mpbird ⊢ F ∈ Poly ⁡ S → * ∘ A ℤ ≥ N + 1 = 0
37 1 2 3 plycjlem ⊢ F ∈ Poly ⁡ S → G = z ∈ ℂ ⟼ ∑ k = 0 N * ∘ A ⁡ k ⁢ z k
38 8 10 14 36 37 coeeq ⊢ F ∈ Poly ⁡ S → coeff ⁡ G = * ∘ A