Metamath Proof Explorer


Theorem rlimneg

Description: Limit of the negative of a sequence. (Contributed by Mario Carneiro, 18-May-2016)

Ref Expression
Hypotheses rlimneg.1 ⊢ φ ∧ k ∈ A → B ∈ V
rlimneg.2 ⊢ φ → k ∈ A ⟼ B ⇝ℝ C
Assertion rlimneg ⊢ φ → k ∈ A ⟼ − B ⇝ℝ − C

Proof

Step Hyp Ref Expression
1 rlimneg.1 ⊢ φ ∧ k ∈ A → B ∈ V
2 rlimneg.2 ⊢ φ → k ∈ A ⟼ B ⇝ℝ C
3 0cnd ⊢ φ ∧ k ∈ A → 0 ∈ ℂ
4 1 2 rlimmptrcl ⊢ φ ∧ k ∈ A → B ∈ ℂ
5 1 ralrimiva ⊢ φ → ∀ k ∈ A B ∈ V
6 dmmptg ⊢ ∀ k ∈ A B ∈ V → dom ⁡ k ∈ A ⟼ B = A
7 5 6 syl ⊢ φ → dom ⁡ k ∈ A ⟼ B = A
8 rlimss ⊢ k ∈ A ⟼ B ⇝ℝ C → dom ⁡ k ∈ A ⟼ B ⊆ ℝ
9 2 8 syl ⊢ φ → dom ⁡ k ∈ A ⟼ B ⊆ ℝ
10 7 9 eqsstrrd ⊢ φ → A ⊆ ℝ
11 0cn ⊢ 0 ∈ ℂ
12 rlimconst ⊢ A ⊆ ℝ ∧ 0 ∈ ℂ → k ∈ A ⟼ 0 ⇝ℝ 0
13 10 11 12 sylancl ⊢ φ → k ∈ A ⟼ 0 ⇝ℝ 0
14 3 4 13 2 rlimsub ⊢ φ → k ∈ A ⟼ 0 − B ⇝ℝ 0 − C
15 df-neg ⊢ − B = 0 − B
16 15 mpteq2i ⊢ k ∈ A ⟼ − B = k ∈ A ⟼ 0 − B
17 df-neg ⊢ − C = 0 − C
18 14 16 17 3brtr4g ⊢ φ → k ∈ A ⟼ − B ⇝ℝ − C