Metamath Proof Explorer


Theorem plyun0

Description: The set of polynomials is unaffected by the addition of zero. (This is built into the definition because all higher powers of a polynomial are effectively zero, so we require that the coefficient field contain zero to simplify some of our closure theorems.) (Contributed by Mario Carneiro, 17-Jul-2014)

Ref Expression
Assertion plyun0 ⊢ Poly ⁡ S ∪ 0 = Poly ⁡ S

Proof

Step Hyp Ref Expression
1 0cn ⊢ 0 ∈ ℂ
2 snssi ⊢ 0 ∈ ℂ → 0 ⊆ ℂ
3 1 2 ax-mp ⊢ 0 ⊆ ℂ
4 3 biantru ⊢ S ⊆ ℂ ↔ S ⊆ ℂ ∧ 0 ⊆ ℂ
5 unss ⊢ S ⊆ ℂ ∧ 0 ⊆ ℂ ↔ S ∪ 0 ⊆ ℂ
6 4 5 bitr2i ⊢ S ∪ 0 ⊆ ℂ ↔ S ⊆ ℂ
7 unass ⊢ S ∪ 0 ∪ 0 = S ∪ 0 ∪ 0
8 unidm ⊢ 0 ∪ 0 = 0
9 8 uneq2i ⊢ S ∪ 0 ∪ 0 = S ∪ 0
10 7 9 eqtri ⊢ S ∪ 0 ∪ 0 = S ∪ 0
11 10 oveq1i ⊢ S ∪ 0 ∪ 0 ℕ 0 = S ∪ 0 ℕ 0
12 11 rexeqi ⊢ ∃ a ∈ S ∪ 0 ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k ↔ ∃ a ∈ S ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k
13 12 rexbii ⊢ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k ↔ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k
14 6 13 anbi12i ⊢ S ∪ 0 ⊆ ℂ ∧ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k ↔ S ⊆ ℂ ∧ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k
15 elply ⊢ f ∈ Poly ⁡ S ∪ 0 ↔ S ∪ 0 ⊆ ℂ ∧ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k
16 elply ⊢ f ∈ Poly ⁡ S ↔ S ⊆ ℂ ∧ ∃ n ∈ ℕ 0 ∃ a ∈ S ∪ 0 ℕ 0 f = z ∈ ℂ ⟼ ∑ k = 0 n a ⁡ k ⁢ z k
17 14 15 16 3bitr4i ⊢ f ∈ Poly ⁡ S ∪ 0 ↔ f ∈ Poly ⁡ S
18 17 eqriv ⊢ Poly ⁡ S ∪ 0 = Poly ⁡ S