Metamath Proof Explorer


Theorem plycpn

Description: Polynomials are smooth. (Contributed by Stefan O'Rear, 16-Nov-2014) (Revised by Mario Carneiro, 11-Feb-2015)

Ref Expression
Assertion plycpn ⊢ F ∈ Poly ⁡ S → F ∈ ⋂ ran ⁡ C n ⁡ ℂ

Proof

Step Hyp Ref Expression
1 plyf ⊢ F ∈ Poly ⁡ S → F : ℂ ⟶ ℂ
2 1 adantr ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → F : ℂ ⟶ ℂ
3 cnex ⊢ ℂ ∈ V
4 3 3 fpm ⊢ F : ℂ ⟶ ℂ → F ∈ ℂ ↑ 𝑝𝑚 ℂ
5 2 4 syl ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → F ∈ ℂ ↑ 𝑝𝑚 ℂ
6 dvnply ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n ∈ Poly ⁡ ℂ
7 plycn ⊢ ℂ D n F ⁡ n ∈ Poly ⁡ ℂ → ℂ D n F ⁡ n : ℂ ⟶cn ℂ
8 6 7 syl ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n : ℂ ⟶cn ℂ
9 2 fdmd ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → dom ⁡ F = ℂ
10 9 oveq1d ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → dom ⁡ F ⟶cn ℂ = ℂ ⟶cn ℂ
11 8 10 eleqtrrd ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → ℂ D n F ⁡ n : dom ⁡ F ⟶cn ℂ
12 ssidd ⊢ F ∈ Poly ⁡ S → ℂ ⊆ ℂ
13 elcpn ⊢ ℂ ⊆ ℂ ∧ n ∈ ℕ 0 → F ∈ C n ⁡ ℂ ⁡ n ↔ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ ℂ D n F ⁡ n : dom ⁡ F ⟶cn ℂ
14 12 13 sylan ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → F ∈ C n ⁡ ℂ ⁡ n ↔ F ∈ ℂ ↑ 𝑝𝑚 ℂ ∧ ℂ D n F ⁡ n : dom ⁡ F ⟶cn ℂ
15 5 11 14 mpbir2and ⊢ F ∈ Poly ⁡ S ∧ n ∈ ℕ 0 → F ∈ C n ⁡ ℂ ⁡ n
16 15 ralrimiva ⊢ F ∈ Poly ⁡ S → ∀ n ∈ ℕ 0 F ∈ C n ⁡ ℂ ⁡ n
17 ssid ⊢ ℂ ⊆ ℂ
18 fncpn ⊢ ℂ ⊆ ℂ → C n ⁡ ℂ Fn ℕ 0
19 eleq2 ⊢ x = C n ⁡ ℂ ⁡ n → F ∈ x ↔ F ∈ C n ⁡ ℂ ⁡ n
20 19 ralrn ⊢ C n ⁡ ℂ Fn ℕ 0 → ∀ x ∈ ran ⁡ C n ⁡ ℂ F ∈ x ↔ ∀ n ∈ ℕ 0 F ∈ C n ⁡ ℂ ⁡ n
21 17 18 20 mp2b ⊢ ∀ x ∈ ran ⁡ C n ⁡ ℂ F ∈ x ↔ ∀ n ∈ ℕ 0 F ∈ C n ⁡ ℂ ⁡ n
22 16 21 sylibr ⊢ F ∈ Poly ⁡ S → ∀ x ∈ ran ⁡ C n ⁡ ℂ F ∈ x
23 elintg ⊢ F ∈ Poly ⁡ S → F ∈ ⋂ ran ⁡ C n ⁡ ℂ ↔ ∀ x ∈ ran ⁡ C n ⁡ ℂ F ∈ x
24 22 23 mpbird ⊢ F ∈ Poly ⁡ S → F ∈ ⋂ ran ⁡ C n ⁡ ℂ