Metamath Proof Explorer


Theorem cn1lem

Description: A sufficient condition for a function to be continuous. (Contributed by Mario Carneiro, 9-Feb-2014)

Ref Expression
Hypotheses cn1lem.1 ⊢ F : ℂ ⟶ ℂ
cn1lem.2 ⊢ z ∈ ℂ ∧ A ∈ ℂ → F ⁡ z − F ⁡ A ≤ z − A
Assertion cn1lem ⊢ A ∈ ℂ ∧ x ∈ ℝ + → ∃ y ∈ ℝ + ∀ z ∈ ℂ z − A < y → F ⁡ z − F ⁡ A < x

Proof

Step Hyp Ref Expression
1 cn1lem.1 ⊢ F : ℂ ⟶ ℂ
2 cn1lem.2 ⊢ z ∈ ℂ ∧ A ∈ ℂ → F ⁡ z − F ⁡ A ≤ z − A
3 simpr ⊢ A ∈ ℂ ∧ x ∈ ℝ + → x ∈ ℝ +
4 simpr ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → z ∈ ℂ
5 simpll ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → A ∈ ℂ
6 4 5 2 syl2anc ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ z − F ⁡ A ≤ z − A
7 1 ffvelcdmi ⊢ z ∈ ℂ → F ⁡ z ∈ ℂ
8 4 7 syl ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ z ∈ ℂ
9 1 ffvelcdmi ⊢ A ∈ ℂ → F ⁡ A ∈ ℂ
10 5 9 syl ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ A ∈ ℂ
11 8 10 subcld ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ z − F ⁡ A ∈ ℂ
12 11 abscld ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ z − F ⁡ A ∈ ℝ
13 4 5 subcld ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → z − A ∈ ℂ
14 13 abscld ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → z − A ∈ ℝ
15 rpre ⊢ x ∈ ℝ + → x ∈ ℝ
16 15 ad2antlr ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → x ∈ ℝ
17 lelttr ⊢ F ⁡ z − F ⁡ A ∈ ℝ ∧ z − A ∈ ℝ ∧ x ∈ ℝ → F ⁡ z − F ⁡ A ≤ z − A ∧ z − A < x → F ⁡ z − F ⁡ A < x
18 12 14 16 17 syl3anc ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → F ⁡ z − F ⁡ A ≤ z − A ∧ z − A < x → F ⁡ z − F ⁡ A < x
19 6 18 mpand ⊢ A ∈ ℂ ∧ x ∈ ℝ + ∧ z ∈ ℂ → z − A < x → F ⁡ z − F ⁡ A < x
20 19 ralrimiva ⊢ A ∈ ℂ ∧ x ∈ ℝ + → ∀ z ∈ ℂ z − A < x → F ⁡ z − F ⁡ A < x
21 breq2 ⊢ y = x → z − A < y ↔ z − A < x
22 21 rspceaimv ⊢ x ∈ ℝ + ∧ ∀ z ∈ ℂ z − A < x → F ⁡ z − F ⁡ A < x → ∃ y ∈ ℝ + ∀ z ∈ ℂ z − A < y → F ⁡ z − F ⁡ A < x
23 3 20 22 syl2anc ⊢ A ∈ ℂ ∧ x ∈ ℝ + → ∃ y ∈ ℝ + ∀ z ∈ ℂ z − A < y → F ⁡ z − F ⁡ A < x