HomeHome Metamath Proof Explorer
Theorem List (p. 399 of 424)
< Previous  Next >
Bad symbols? Try the
GIF version.

Mirrors  >  Metamath Home Page  >  MPE Home Page  >  Theorem List Contents  >  Recent Proofs       This page: Page List

Color key:    Metamath Proof Explorer  Metamath Proof Explorer
(1-27745)
  Hilbert Space Explorer  Hilbert Space Explorer
(27746-29270)
  Users' Mathboxes  Users' Mathboxes
(29271-42316)
 

Theorem List for Metamath Proof Explorer - 39801-39900   *Has distinct variable group(s)
TypeLabelDescription
Statement
 
Theoremliminflelimsuplem 39801* The superior limit is greater than or equal to the inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝐹𝑉)    &   (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅)       (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))
 
Theoremliminflelimsup 39802* The superior limit is greater than or equal to the inferior limit. The second hypothesis is needed (see liminflelimsupcex 39823 for a counterexample). The inequality can be strict, see liminfltlimsupex 39807. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝐹𝑉)    &   (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅)       (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))
 
Theoremlimsupgtlem 39803* For any positive real, the superior limit of F is larger than any of its values at large enough arguments, up to that positive real. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑 → (lim sup‘𝐹) ∈ ℝ)    &   (𝜑𝑋 ∈ ℝ+)       (𝜑 → ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)((𝐹𝑘) − 𝑋) < (lim sup‘𝐹))
 
Theoremlimsupgt 39804* Given a sequence of real numbers, there exists an upper part of the sequence that's appxoximated from below by the superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑 → (lim sup‘𝐹) ∈ ℝ)    &   (𝜑𝑋 ∈ ℝ+)       (𝜑 → ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)((𝐹𝑘) − 𝑋) < (lim sup‘𝐹))
 
Theoremliminfresre 39805 The inferior limit of a function only depends on the real part of its domain. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝐹𝑉)       (𝜑 → (lim inf‘(𝐹 ↾ ℝ)) = (lim inf‘𝐹))
 
Theoremliminfresicompt 39806* The inferior limit doesn't change when a function is restricted to the upper part of the reals. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℝ)    &   𝑍 = (𝑀[,)+∞)    &   (𝜑𝐴𝑉)       (𝜑 → (lim inf‘(𝑥 ∈ (𝐴𝑍) ↦ 𝐵)) = (lim inf‘(𝑥𝐴𝐵)))
 
Theoremliminfltlimsupex 39807 An example where the lim inf is strictly smaller than the lim sup. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝐹 = (𝑛 ∈ ℕ ↦ if(2 ∥ 𝑛, 0, 1))       (lim inf‘𝐹) < (lim sup‘𝐹)
 
Theoremliminfgelimsup 39808* The inferior limit is greater than or equal to the superior limit if and only if they are equal. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝐹𝑉)    &   (𝜑 → ∀𝑘 ∈ ℝ ∃𝑗 ∈ (𝑘[,)+∞)((𝐹 “ (𝑗[,)+∞)) ∩ ℝ*) ≠ ∅)       (𝜑 → ((lim sup‘𝐹) ≤ (lim inf‘𝐹) ↔ (lim inf‘𝐹) = (lim sup‘𝐹)))
 
Theoremliminfvalxr 39809* Alternate definition of lim inf when 𝐹 is an extended real valued function. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑥𝐹    &   (𝜑𝐴𝑉)    &   (𝜑𝐹:𝐴⟶ℝ*)       (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑥𝐴 ↦ -𝑒(𝐹𝑥))))
 
Theoremliminfresuz 39810 If the real part of the domain of a function is a subset of the integers, the inferior limit doesn't change when the function is restricted to an upper set of integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹𝑉)    &   (𝜑 → dom (𝐹 ↾ ℝ) ⊆ ℤ)       (𝜑 → (lim inf‘(𝐹𝑍)) = (lim inf‘𝐹))
 
Theoremliminflelimsupuz 39811 The superior limit is greater than or equal to the inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ*)       (𝜑 → (lim inf‘𝐹) ≤ (lim sup‘𝐹))
 
Theoremliminfvalxrmpt 39812* Alternate definition of lim inf when 𝐹 is an extended real valued function. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑥𝜑    &   (𝜑𝐴𝑉)    &   ((𝜑𝑥𝐴) → 𝐵 ∈ ℝ*)       (𝜑 → (lim inf‘(𝑥𝐴𝐵)) = -𝑒(lim sup‘(𝑥𝐴 ↦ -𝑒𝐵)))
 
Theoremliminfresuz2 39813 If the domain of a function is a subset of the integers, the inferior limit doesn't change when the function is restricted to an upper set of integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹𝑉)    &   (𝜑 → dom 𝐹 ⊆ ℤ)       (𝜑 → (lim inf‘(𝐹𝑍)) = (lim inf‘𝐹))
 
Theoremliminfgelimsupuz 39814 The inferior limit is greater than or equal to the superior limit if and only if they are equal. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → ((lim sup‘𝐹) ≤ (lim inf‘𝐹) ↔ (lim inf‘𝐹) = (lim sup‘𝐹)))
 
Theoremliminfval4 39815* Alternate definition of lim inf when the given function is eventually real valued. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑥𝜑    &   (𝜑𝐴𝑉)    &   (𝜑𝑀 ∈ ℝ)    &   ((𝜑𝑥 ∈ (𝐴 ∩ (𝑀[,)+∞))) → 𝐵 ∈ ℝ)       (𝜑 → (lim inf‘(𝑥𝐴𝐵)) = -𝑒(lim sup‘(𝑥𝐴 ↦ -𝐵)))
 
Theoremliminfval3 39816* Alternate definition of lim inf when the given function is eventually extended real valued. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑥𝜑    &   (𝜑𝐴𝑉)    &   (𝜑𝑀 ∈ ℝ)    &   ((𝜑𝑥 ∈ (𝐴 ∩ (𝑀[,)+∞))) → 𝐵 ∈ ℝ*)       (𝜑 → (lim inf‘(𝑥𝐴𝐵)) = -𝑒(lim sup‘(𝑥𝐴 ↦ -𝑒𝐵)))
 
Theoremliminfequzmpt2 39817* Two functions that are eventually equal to one another have the same superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑗𝜑    &   𝑗𝐴    &   𝑗𝐵    &   𝐴 = (ℤ𝑀)    &   𝐵 = (ℤ𝑁)    &   (𝜑𝐾𝐴)    &   (𝜑𝐾𝐵)    &   ((𝜑𝑗 ∈ (ℤ𝐾)) → 𝐶𝑉)       (𝜑 → (lim inf‘(𝑗𝐴𝐶)) = (lim inf‘(𝑗𝐵𝐶)))
 
Theoremliminfvaluz 39818* Alternate definition of lim inf for an extended real valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   ((𝜑𝑘𝑍) → 𝐵 ∈ ℝ*)       (𝜑 → (lim inf‘(𝑘𝑍𝐵)) = -𝑒(lim sup‘(𝑘𝑍 ↦ -𝑒𝐵)))
 
Theoremliminf0 39819 The inferior limit of the empty set. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(lim inf‘∅) = +∞
 
Theoremlimsupval4 39820* Alternate definition of lim inf when the given a function is eventually extended real valued. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑥𝜑    &   (𝜑𝐴𝑉)    &   (𝜑𝑀 ∈ ℝ)    &   ((𝜑𝑥 ∈ (𝐴 ∩ (𝑀[,)+∞))) → 𝐵 ∈ ℝ*)       (𝜑 → (lim sup‘(𝑥𝐴𝐵)) = -𝑒(lim inf‘(𝑥𝐴 ↦ -𝑒𝐵)))
 
Theoremliminfvaluz2 39821* Alternate definition of lim inf for a real-valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   ((𝜑𝑘𝑍) → 𝐵 ∈ ℝ)       (𝜑 → (lim inf‘(𝑘𝑍𝐵)) = -𝑒(lim sup‘(𝑘𝑍 ↦ -𝐵)))
 
Theoremliminfvaluz3 39822* Alternate definition of lim inf for an extended real valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   𝑘𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ*)       (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑘𝑍 ↦ -𝑒(𝐹𝑘))))
 
Theoremliminflelimsupcex 39823 A counterexample for liminflelimsup 39802, showing that the second hypothesis is needed. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(lim sup‘∅) < (lim inf‘∅)
 
Theoremlimsupvaluz3 39824* Alternate definition of lim inf for an extended real valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   ((𝜑𝑘𝑍) → 𝐵 ∈ ℝ*)       (𝜑 → (lim sup‘(𝑘𝑍𝐵)) = -𝑒(lim inf‘(𝑘𝑍 ↦ -𝑒𝐵)))
 
Theoremliminfvaluz4 39825* Alternate definition of lim inf for a real-valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   𝑘𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (lim inf‘𝐹) = -𝑒(lim sup‘(𝑘𝑍 ↦ -(𝐹𝑘))))
 
Theoremlimsupvaluz4 39826* Alternate definition of lim inf for a real-valued function, defined on a set of upper integers. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝜑    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   ((𝜑𝑘𝑍) → 𝐵 ∈ ℝ)       (𝜑 → (lim sup‘(𝑘𝑍𝐵)) = -𝑒(lim inf‘(𝑘𝑍 ↦ -𝐵)))
 
Theoremclimliminflimsupd 39827 If a sequence of real numbers converges, its inferior limit and its superior limit are equal. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑𝐹 ∈ dom ⇝ )       (𝜑 → (lim inf‘𝐹) = (lim sup‘𝐹))
 
Theoremliminfreuzlem 39828* Given a function on the reals, its inferior limit is real if and only if two condition holds: 1. there is a real number that is greater than or equal to the function, infinitely often; 2. there is a real number that is smaller than or equal to the function. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑗𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
 
Theoremliminfreuz 39829* Given a function on the reals, its inferior limit is real if and only if two condition holds: 1. there is a real number that is greater than or equal to the function, infinitely often; 2. there is a real number that is smaller than or equal to the function. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑗𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → ((lim inf‘𝐹) ∈ ℝ ↔ (∃𝑥 ∈ ℝ ∀𝑘𝑍𝑗 ∈ (ℤ𝑘)(𝐹𝑗) ≤ 𝑥 ∧ ∃𝑥 ∈ ℝ ∀𝑗𝑍 𝑥 ≤ (𝐹𝑗))))
 
Theoremliminfltlem 39830* Given a sequence of real numbers, there exists an upper part of the sequence that's approximated from above by the inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑 → (lim inf‘𝐹) ∈ ℝ)    &   (𝜑𝑋 ∈ ℝ+)       (𝜑 → ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)(lim inf‘𝐹) < ((𝐹𝑘) + 𝑋))
 
Theoremliminflt 39831* Given a sequence of real numbers, there exists an upper part of the sequence that's approximated from above by the inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
𝑘𝐹    &   (𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑 → (lim inf‘𝐹) ∈ ℝ)    &   (𝜑𝑋 ∈ ℝ+)       (𝜑 → ∃𝑗𝑍𝑘 ∈ (ℤ𝑗)(lim inf‘𝐹) < ((𝐹𝑘) + 𝑋))
 
Theoremclimliminf 39832 A sequence of real numbers converges if and only if it converges to its inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (𝐹 ∈ dom ⇝ ↔ 𝐹 ⇝ (lim inf‘𝐹)))
 
Theoremliminflimsupclim 39833 A sequence of real numbers converges if its inferior limit is real, and it is greater or equal to the superior limit (in such a case, they are actually equal, see liminflelimsupuz 39811). (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)    &   (𝜑 → (lim inf‘𝐹) ∈ ℝ)    &   (𝜑 → (lim sup‘𝐹) ≤ (lim inf‘𝐹))       (𝜑𝐹 ∈ dom ⇝ )
 
Theoremclimliminflimsup 39834 A sequence of real numbers converges if and only if its inferior limit is real and it is greater than or equal to its superior limit (in such a case, they are actually equal, see liminfgelimsupuz 39814). (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (𝐹 ∈ dom ⇝ ↔ ((lim inf‘𝐹) ∈ ℝ ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹))))
 
Theoremclimliminflimsup2 39835 A sequence of real numbers converges if and only if its superior limit is real and it is less than or equal to its inferior limit (in such a case, they are actually equal, see liminfgelimsupuz 39814). (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (𝐹 ∈ dom ⇝ ↔ ((lim sup‘𝐹) ∈ ℝ ∧ (lim sup‘𝐹) ≤ (lim inf‘𝐹))))
 
Theoremclimliminflimsup3 39836 A sequence of real numbers converges if and only if its inferior limit is real and equal to its superior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (𝐹 ∈ dom ⇝ ↔ ((lim inf‘𝐹) ∈ ℝ ∧ (lim inf‘𝐹) = (lim sup‘𝐹))))
 
Theoremclimliminflimsup4 39837 A sequence of real numbers converges if and only if its superior limit is real and equal to its inferior limit. (Contributed by Glauco Siliprandi, 2-Jan-2022.)
(𝜑𝑀 ∈ ℤ)    &   𝑍 = (ℤ𝑀)    &   (𝜑𝐹:𝑍⟶ℝ)       (𝜑 → (𝐹 ∈ dom ⇝ ↔ ((lim sup‘𝐹) ∈ ℝ ∧ (lim inf‘𝐹) = (lim sup‘𝐹))))
 
20.31.8  Trigonometry
 
Theoremcoseq0 39838 A complex number whose cosine is zero. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝐴 ∈ ℂ → ((cos‘𝐴) = 0 ↔ ((𝐴 / π) + (1 / 2)) ∈ ℤ))
 
Theoremsinmulcos 39839 Multiplication formula for sine and cosine. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → ((sin‘𝐴) · (cos‘𝐵)) = (((sin‘(𝐴 + 𝐵)) + (sin‘(𝐴𝐵))) / 2))
 
Theoremcoskpi2 39840 The cosine of an integer multiple of negative π is either 1 or negative 1. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝐾 ∈ ℤ → (cos‘(𝐾 · π)) = if(2 ∥ 𝐾, 1, -1))
 
Theoremcosnegpi 39841 The cosine of negative π is negative 1. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(cos‘-π) = -1
 
Theoremsinaover2ne0 39842 If 𝐴 in (0, 2π) then sin(𝐴 / 2) is not 0. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝐴 ∈ (0(,)(2 · π)) → (sin‘(𝐴 / 2)) ≠ 0)
 
Theoremcosknegpi 39843 The cosine of an integer multiple of negative π is either 1 ore negative 1. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝐾 ∈ ℤ → (cos‘(𝐾 · -π)) = if(2 ∥ 𝐾, 1, -1))
 
20.31.9  Continuous Functions
 
Theoremmulcncff 39844 The multiplication of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐹 ∈ (𝑋cn→ℂ))    &   (𝜑𝐺 ∈ (𝑋cn→ℂ))       (𝜑 → (𝐹𝑓 · 𝐺) ∈ (𝑋cn→ℂ))
 
Theoremsubcncf 39845* The addition of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑 → (𝑥𝑋𝐴) ∈ (𝑋cn→ℂ))    &   (𝜑 → (𝑥𝑋𝐵) ∈ (𝑋cn→ℂ))       (𝜑 → (𝑥𝑋 ↦ (𝐴𝐵)) ∈ (𝑋cn→ℂ))
 
Theoremcncfmptssg 39846* A continuous complex function restricted to a subset is continuous, using "map to" notation. This theorem generalizes cncfmptss 39619 because it allows to establish a subset for the codomain also. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝐹 = (𝑥𝐴𝐸)    &   (𝜑𝐹 ∈ (𝐴cn𝐵))    &   (𝜑𝐶𝐴)    &   (𝜑𝐷𝐵)    &   ((𝜑𝑥𝐶) → 𝐸𝐷)       (𝜑 → (𝑥𝐶𝐸) ∈ (𝐶cn𝐷))
 
Theoremconstcncfg 39847* A constant function is a continuous function on . (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝐵𝐶)    &   (𝜑𝐶 ⊆ ℂ)       (𝜑 → (𝑥𝐴𝐵) ∈ (𝐴cn𝐶))
 
Theoremidcncfg 39848* The identity function is a continuous function on . (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴𝐵)    &   (𝜑𝐵 ⊆ ℂ)       (𝜑 → (𝑥𝐴𝑥) ∈ (𝐴cn𝐵))
 
Theoremaddcncf 39849* The addition of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑 → (𝑥𝑋𝐴) ∈ (𝑋cn→ℂ))    &   (𝜑 → (𝑥𝑋𝐵) ∈ (𝑋cn→ℂ))       (𝜑 → (𝑥𝑋 ↦ (𝐴 + 𝐵)) ∈ (𝑋cn→ℂ))
 
Theoremcncfshift 39850* A periodic continuous function stays continuous if the domain is shifted a period. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝑇 ∈ ℂ)    &   𝐵 = {𝑥 ∈ ℂ ∣ ∃𝑦𝐴 𝑥 = (𝑦 + 𝑇)}    &   (𝜑𝐹 ∈ (𝐴cn→ℂ))    &   𝐺 = (𝑥𝐵 ↦ (𝐹‘(𝑥𝑇)))       (𝜑𝐺 ∈ (𝐵cn→ℂ))
 
Theoremresincncf 39851 sin restricted to reals is continuous from reals to reals. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(sin ↾ ℝ) ∈ (ℝ–cn→ℝ)
 
Theoremaddccncf2 39852* Adding a constant is a continuous function. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝐹 = (𝑥𝐴 ↦ (𝐵 + 𝑥))       ((𝐴 ⊆ ℂ ∧ 𝐵 ∈ ℂ) → 𝐹 ∈ (𝐴cn→ℂ))
 
Theorem0cnf 39853 The empty set is a continuous function. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
∅ ∈ ({∅} Cn {∅})
 
Theoremfsumcncf 39854* The finite sum of continuous complex function is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑋 ⊆ ℂ)    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → (𝑥𝑋𝐵) ∈ (𝑋cn→ℂ))       (𝜑 → (𝑥𝑋 ↦ Σ𝑘𝐴 𝐵) ∈ (𝑋cn→ℂ))
 
Theoremcncfperiod 39855* A periodic continuous function stays continuous if the domain is shifted a period. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝑇 ∈ ℝ)    &   𝐵 = {𝑥 ∈ ℂ ∣ ∃𝑦𝐴 𝑥 = (𝑦 + 𝑇)}    &   (𝜑𝐹:dom 𝐹⟶ℂ)    &   (𝜑𝐵 ⊆ dom 𝐹)    &   ((𝜑𝑥𝐴) → (𝐹‘(𝑥 + 𝑇)) = (𝐹𝑥))    &   (𝜑 → (𝐹𝐴) ∈ (𝐴cn→ℂ))       (𝜑 → (𝐹𝐵) ∈ (𝐵cn→ℂ))
 
Theoremsubcncff 39856 The subtraction of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐹 ∈ (𝑋cn→ℂ))    &   (𝜑𝐺 ∈ (𝑋cn→ℂ))       (𝜑 → (𝐹𝑓𝐺) ∈ (𝑋cn→ℂ))
 
Theoremnegcncfg 39857* The opposite of a continuous function is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑 → (𝑥𝐴𝐵) ∈ (𝐴cn→ℂ))       (𝜑 → (𝑥𝐴 ↦ -𝐵) ∈ (𝐴cn→ℂ))
 
Theoremcnfdmsn 39858* A function with a singleton domain is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐴𝑉𝐵𝑊) → (𝑥 ∈ {𝐴} ↦ 𝐵) ∈ (𝒫 {𝐴} Cn 𝒫 {𝐵}))
 
Theoremcncfcompt 39859* Composition of continuous functions. A generalization of cncfmpt1f 22697 to arbitrary domains. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑 → (𝑥𝐴𝐵) ∈ (𝐴cn𝐶))    &   (𝜑𝐹 ∈ (𝐶cn𝐷))       (𝜑 → (𝑥𝐴 ↦ (𝐹𝐵)) ∈ (𝐴cn𝐷))
 
Theoremaddcncff 39860 The addition of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐹 ∈ (𝑋cn→ℂ))    &   (𝜑𝐺 ∈ (𝑋cn→ℂ))       (𝜑 → (𝐹𝑓 + 𝐺) ∈ (𝑋cn→ℂ))
 
Theoremioccncflimc 39861 Limit at the upper bound, of a continuous function defined on a left open right closed interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ*)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)    &   (𝜑𝐹 ∈ ((𝐴(,]𝐵)–cn→ℂ))       (𝜑 → (𝐹𝐵) ∈ ((𝐹 ↾ (𝐴(,)𝐵)) lim 𝐵))
 
Theoremcncfuni 39862* A function is continuous if it's domain is the union of sets over which the function is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐴 𝐵)    &   ((𝜑𝑏𝐵) → (𝐴𝑏) ∈ ((TopOpen‘ℂfld) ↾t 𝐴))    &   ((𝜑𝑏𝐵) → (𝐹𝑏) ∈ ((𝐴𝑏)–cn→ℂ))       (𝜑𝐹 ∈ (𝐴cn→ℂ))
 
Theoremicccncfext 39863* A continuous function on a closed interval can be extended to a continuous function on the whole real line. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝑥𝐹    &   𝐽 = (topGen‘ran (,))    &   𝑌 = 𝐾    &   𝐺 = (𝑥 ∈ ℝ ↦ if(𝑥 ∈ (𝐴[,]𝐵), (𝐹𝑥), if(𝑥 < 𝐴, (𝐹𝐴), (𝐹𝐵))))    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑𝐾 ∈ Top)    &   (𝜑𝐹 ∈ ((𝐽t (𝐴[,]𝐵)) Cn 𝐾))       (𝜑 → (𝐺 ∈ (𝐽 Cn (𝐾t ran 𝐹)) ∧ (𝐺 ↾ (𝐴[,]𝐵)) = 𝐹))
 
Theoremcncficcgt0 39864* A the absolute value of a continuous function on a closed interval, that is never 0, has a strictly positive lower bound. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝐹 = (𝑥 ∈ (𝐴[,]𝐵) ↦ 𝐶)    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴𝐵)    &   (𝜑𝐹 ∈ ((𝐴[,]𝐵)–cn→(ℝ ∖ {0})))       (𝜑 → ∃𝑦 ∈ ℝ+𝑥 ∈ (𝐴[,]𝐵)𝑦 ≤ (abs‘𝐶))
 
Theoremicocncflimc 39865 Limit at the lower bound, of a continuous function defined on a left closed right open interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ*)    &   (𝜑𝐴 < 𝐵)    &   (𝜑𝐹 ∈ ((𝐴[,)𝐵)–cn→ℂ))       (𝜑 → (𝐹𝐴) ∈ ((𝐹 ↾ (𝐴(,)𝐵)) lim 𝐴))
 
Theoremcncfdmsn 39866* A complex function with a singleton domain is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (𝑥 ∈ {𝐴} ↦ 𝐵) ∈ ({𝐴}–cn→{𝐵}))
 
Theoremdivcncff 39867 The quotient of two continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐹 ∈ (𝑋cn→ℂ))    &   (𝜑𝐺 ∈ (𝑋cn→(ℂ ∖ {0})))       (𝜑 → (𝐹𝑓 / 𝐺) ∈ (𝑋cn→ℂ))
 
Theoremcncfshiftioo 39868* A periodic continuous function stays continuous if the domain is an open interval that is shifted a period. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   𝐶 = (𝐴(,)𝐵)    &   (𝜑𝑇 ∈ ℝ)    &   𝐷 = ((𝐴 + 𝑇)(,)(𝐵 + 𝑇))    &   (𝜑𝐹 ∈ (𝐶cn→ℂ))    &   𝐺 = (𝑥𝐷 ↦ (𝐹‘(𝑥𝑇)))       (𝜑𝐺 ∈ (𝐷cn→ℂ))
 
Theoremcncfiooicclem1 39869* A continuous function 𝐹 on an open interval (𝐴(,)𝐵) can be extended to a continuous function 𝐺 on the corresponding closed interval, if it has a finite right limit 𝑅 in 𝐴 and a finite left limit 𝐿 in 𝐵. 𝐹 can be complex valued. This lemma assumes 𝐴 < 𝐵, the invoking theorem drops this assumption. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝑥𝜑    &   𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹𝑥))))    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑𝐿 ∈ (𝐹 lim 𝐵))    &   (𝜑𝑅 ∈ (𝐹 lim 𝐴))       (𝜑𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))
 
Theoremcncfiooicc 39870* A continuous function 𝐹 on an open interval (𝐴(,)𝐵) can be extended to a continuous function 𝐺 on the corresponding closed interval, if it has a finite right limit 𝑅 in 𝐴 and a finite left limit 𝐿 in 𝐵. 𝐹 can be complex valued. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝑥𝜑    &   𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹𝑥))))    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑𝐿 ∈ (𝐹 lim 𝐵))    &   (𝜑𝑅 ∈ (𝐹 lim 𝐴))       (𝜑𝐺 ∈ ((𝐴[,]𝐵)–cn→ℂ))
 
Theoremcncfiooiccre 39871* A continuous function 𝐹 on an open interval (𝐴(,)𝐵) can be extended to a continuous function 𝐺 on the corresponding closed interval, if it has a finite right limit 𝑅 in 𝐴 and a finite left limit 𝐿 in 𝐵. 𝐹 is assumed to be real-valued. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝑥𝜑    &   𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹𝑥))))    &   (𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐴 < 𝐵)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℝ))    &   (𝜑𝐿 ∈ (𝐹 lim 𝐵))    &   (𝜑𝑅 ∈ (𝐹 lim 𝐴))       (𝜑𝐺 ∈ ((𝐴[,]𝐵)–cn→ℝ))
 
Theoremcncfioobdlem 39872* 𝐺 actually extends 𝐹. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐹:(𝐴(,)𝐵)⟶𝑉)    &   𝐺 = (𝑥 ∈ (𝐴[,]𝐵) ↦ if(𝑥 = 𝐴, 𝑅, if(𝑥 = 𝐵, 𝐿, (𝐹𝑥))))    &   (𝜑𝐶 ∈ (𝐴(,)𝐵))       (𝜑 → (𝐺𝐶) = (𝐹𝐶))
 
Theoremcncfioobd 39873* A continuous function 𝐹 on an open interval (𝐴(,)𝐵) with a finite right limit 𝑅 in 𝐴 and a finite left limit 𝐿 in 𝐵 is bounded. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐴 ∈ ℝ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐹 ∈ ((𝐴(,)𝐵)–cn→ℂ))    &   (𝜑𝐿 ∈ (𝐹 lim 𝐵))    &   (𝜑𝑅 ∈ (𝐹 lim 𝐴))       (𝜑 → ∃𝑥 ∈ ℝ ∀𝑦 ∈ (𝐴(,)𝐵)(abs‘(𝐹𝑦)) ≤ 𝑥)
 
Theoremjumpncnp 39874 Jump discontinuity or discontinuity of the first kind: if the left and the right limit don't match, the function is discontinuous at the point. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝐾 = (TopOpen‘ℂfld)    &   (𝜑𝐴 ⊆ ℝ)    &   𝐽 = (topGen‘ran (,))    &   (𝜑𝐹:𝐴⟶ℂ)    &   (𝜑𝐵 ∈ ℝ)    &   (𝜑𝐵 ∈ ((limPt‘𝐽)‘(𝐴 ∩ (-∞(,)𝐵))))    &   (𝜑𝐵 ∈ ((limPt‘𝐽)‘(𝐴 ∩ (𝐵(,)+∞))))    &   (𝜑𝐿 ∈ ((𝐹 ↾ (-∞(,)𝐵)) lim 𝐵))    &   (𝜑𝑅 ∈ ((𝐹 ↾ (𝐵(,)+∞)) lim 𝐵))    &   (𝜑𝐿𝑅)       (𝜑 → ¬ 𝐹 ∈ ((𝐽 CnP (TopOpen‘ℂfld))‘𝐵))
 
Theoremcncfcompt2 39875* Composition of continuous functions. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
𝑥𝜑    &   (𝜑 → (𝑥𝐴𝑅) ∈ (𝐴cn𝐵))    &   (𝜑 → (𝑦𝐶𝑆) ∈ (𝐶cn𝐸))    &   (𝜑𝐵𝐶)    &   (𝑦 = 𝑅𝑆 = 𝑇)       (𝜑 → (𝑥𝐴𝑇) ∈ (𝐴cn𝐸))
 
Theoremcxpcncf2 39876* The complex power function is continuous with respect to its second argument. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
(𝐴 ∈ (ℂ ∖ (-∞(,]0)) → (𝑥 ∈ ℂ ↦ (𝐴𝑐𝑥)) ∈ (ℂ–cn→ℂ))
 
Theoremfprodcncf 39877* The finite product of continuous complex functions is continuous. (Contributed by Glauco Siliprandi, 5-Apr-2020.)
(𝜑𝐴 ⊆ ℂ)    &   (𝜑𝐵 ∈ Fin)    &   ((𝜑𝑥𝐴𝑘𝐵) → 𝐶 ∈ ℂ)    &   ((𝜑𝑘𝐵) → (𝑥𝐴𝐶) ∈ (𝐴cn→ℂ))       (𝜑 → (𝑥𝐴 ↦ ∏𝑘𝐵 𝐶) ∈ (𝐴cn→ℂ))
 
Theoremadd1cncf 39878* Addition to a constant is a continuous function. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
(𝜑𝐴 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ (𝑥 + 𝐴))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremadd2cncf 39879* Addition to a constant is a continuous function. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
(𝜑𝐴 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ (𝐴 + 𝑥))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremsub1cncfd 39880* Subtracting a constant is a continuous function. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
(𝜑𝐴 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ (𝑥𝐴))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremsub2cncfd 39881* Subtraction from a constant is a continuous function. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
(𝜑𝐴 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ (𝐴𝑥))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremfprodsub2cncf 39882* 𝐹 is continuous. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘𝐴 (𝐵𝑥))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremfprodadd2cncf 39883* 𝐹 is continuous. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘𝐴 (𝐵 + 𝑥))       (𝜑𝐹 ∈ (ℂ–cn→ℂ))
 
Theoremfprodsubrecnncnvlem 39884* The sequence 𝑆 of finite products, where every factor is subtracted an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘𝐴 (𝐵 − (1 / 𝑛)))    &   𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘𝐴 (𝐵𝑥))    &   𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))       (𝜑𝑆 ⇝ ∏𝑘𝐴 𝐵)
 
Theoremfprodsubrecnncnv 39885* The sequence 𝑆 of finite products, where every factor is subtracted an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝑋 ∈ Fin)    &   ((𝜑𝑘𝑋) → 𝐴 ∈ ℂ)    &   𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘𝑋 (𝐴 − (1 / 𝑛)))       (𝜑𝑆 ⇝ ∏𝑘𝑋 𝐴)
 
Theoremfprodaddrecnncnvlem 39886* The sequence 𝑆 of finite products, where every factor is added an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝐴 ∈ Fin)    &   ((𝜑𝑘𝐴) → 𝐵 ∈ ℂ)    &   𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘𝐴 (𝐵 + (1 / 𝑛)))    &   𝐹 = (𝑥 ∈ ℂ ↦ ∏𝑘𝐴 (𝐵 + 𝑥))    &   𝐺 = (𝑛 ∈ ℕ ↦ (1 / 𝑛))       (𝜑𝑆 ⇝ ∏𝑘𝐴 𝐵)
 
Theoremfprodaddrecnncnv 39887* The sequence 𝑆 of finite products, where every factor is added an "always smaller" amount, converges to the finite product of the factors. (Contributed by Glauco Siliprandi, 8-Apr-2021.)
𝑘𝜑    &   (𝜑𝑋 ∈ Fin)    &   ((𝜑𝑘𝑋) → 𝐴 ∈ ℂ)    &   𝑆 = (𝑛 ∈ ℕ ↦ ∏𝑘𝑋 (𝐴 + (1 / 𝑛)))       (𝜑𝑆 ⇝ ∏𝑘𝑋 𝐴)
 
20.31.10  Derivatives
 
Theoremdvsinexp 39888* The derivative of sin^N . (Contributed by Glauco Siliprandi, 29-Jun-2017.)
(𝜑𝑁 ∈ ℕ)       (𝜑 → (ℂ D (𝑥 ∈ ℂ ↦ ((sin‘𝑥)↑𝑁))) = (𝑥 ∈ ℂ ↦ ((𝑁 · ((sin‘𝑥)↑(𝑁 − 1))) · (cos‘𝑥))))
 
Theoremdvcosre 39889 The real derivative of the cosine. (Contributed by Glauco Siliprandi, 29-Jun-2017.)
(ℝ D (𝑥 ∈ ℝ ↦ (cos‘𝑥))) = (𝑥 ∈ ℝ ↦ -(sin‘𝑥))
 
Theoremdvsinax 39890* Derivative exercise: the derivative with respect to y of sin(Ay), given a constant 𝐴. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝐴 ∈ ℂ → (ℂ D (𝑦 ∈ ℂ ↦ (sin‘(𝐴 · 𝑦)))) = (𝑦 ∈ ℂ ↦ (𝐴 · (cos‘(𝐴 · 𝑦)))))
 
Theoremdvsubf 39891 The subtraction rule for everywhere-differentiable functions. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝑋⟶ℂ)    &   (𝜑𝐺:𝑋⟶ℂ)    &   (𝜑 → dom (𝑆 D 𝐹) = 𝑋)    &   (𝜑 → dom (𝑆 D 𝐺) = 𝑋)       (𝜑 → (𝑆 D (𝐹𝑓𝐺)) = ((𝑆 D 𝐹) ∘𝑓 − (𝑆 D 𝐺)))
 
Theoremdvmptconst 39892* Function-builder for derivative: derivative of a constant. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐴 ∈ ((TopOpen‘ℂfld) ↾t 𝑆))    &   (𝜑𝐵 ∈ ℂ)       (𝜑 → (𝑆 D (𝑥𝐴𝐵)) = (𝑥𝐴 ↦ 0))
 
Theoremdvcnre 39893 From compex differentiation to real differentiation. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐹:ℂ⟶ℂ ∧ ℝ ⊆ dom (ℂ D 𝐹)) → (ℝ D (𝐹 ↾ ℝ)) = ((ℂ D 𝐹) ↾ ℝ))
 
Theoremdvmptidg 39894* Function-builder for derivative: derivative of the identity. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐴 ∈ ((TopOpen‘ℂfld) ↾t 𝑆))       (𝜑 → (𝑆 D (𝑥𝐴𝑥)) = (𝑥𝐴 ↦ 1))
 
Theoremdvresntr 39895 Function-builder for derivative: expand the function from an open set to its closure. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑆 ⊆ ℂ)    &   (𝜑𝑋𝑆)    &   (𝜑𝐹:𝑋⟶ℂ)    &   𝐽 = (𝐾t 𝑆)    &   𝐾 = (TopOpen‘ℂfld)    &   (𝜑 → ((int‘𝐽)‘𝑋) = 𝑌)       (𝜑 → (𝑆 D 𝐹) = (𝑆 D (𝐹𝑌)))
 
Theoremfperdvper 39896* The derivative of a periodic function is periodic. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝐹:ℝ⟶ℂ)    &   (𝜑𝑇 ∈ ℝ)    &   ((𝜑𝑥 ∈ ℝ) → (𝐹‘(𝑥 + 𝑇)) = (𝐹𝑥))    &   𝐺 = (ℝ D 𝐹)       ((𝜑𝑥 ∈ dom 𝐺) → ((𝑥 + 𝑇) ∈ dom 𝐺 ∧ (𝐺‘(𝑥 + 𝑇)) = (𝐺𝑥)))
 
Theoremdvmptresicc 39897* Derivative of a function restricted to a closed interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
𝐹 = (𝑥 ∈ ℂ ↦ 𝐴)    &   ((𝜑𝑥 ∈ ℂ) → 𝐴 ∈ ℂ)    &   (𝜑 → (ℂ D 𝐹) = (𝑥 ∈ ℂ ↦ 𝐵))    &   ((𝜑𝑥 ∈ ℂ) → 𝐵 ∈ ℂ)    &   (𝜑𝐶 ∈ ℝ)    &   (𝜑𝐷 ∈ ℝ)       (𝜑 → (ℝ D (𝑥 ∈ (𝐶[,]𝐷) ↦ 𝐴)) = (𝑥 ∈ (𝐶(,)𝐷) ↦ 𝐵))
 
Theoremdvasinbx 39898* Derivative exercise: the derivative with respect to y of A x sin(By), given two constants 𝐴 and 𝐵. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐴 ∈ ℂ ∧ 𝐵 ∈ ℂ) → (ℂ D (𝑦 ∈ ℂ ↦ (𝐴 · (sin‘(𝐵 · 𝑦))))) = (𝑦 ∈ ℂ ↦ ((𝐴 · 𝐵) · (cos‘(𝐵 · 𝑦)))))
 
Theoremdvresioo 39899 Restriction of a derivative to an open interval. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
((𝐴 ⊆ ℝ ∧ 𝐹:𝐴⟶ℂ) → (ℝ D (𝐹 ↾ (𝐵(,)𝐶))) = ((ℝ D 𝐹) ↾ (𝐵(,)𝐶)))
 
Theoremdvdivf 39900 The quotient rule for everywhere-differentiable functions. (Contributed by Glauco Siliprandi, 11-Dec-2019.)
(𝜑𝑆 ∈ {ℝ, ℂ})    &   (𝜑𝐹:𝑋⟶ℂ)    &   (𝜑𝐺:𝑋⟶(ℂ ∖ {0}))    &   (𝜑 → dom (𝑆 D 𝐹) = 𝑋)    &   (𝜑 → dom (𝑆 D 𝐺) = 𝑋)       (𝜑 → (𝑆 D (𝐹𝑓 / 𝐺)) = ((((𝑆 D 𝐹) ∘𝑓 · 𝐺) ∘𝑓 − ((𝑆 D 𝐺) ∘𝑓 · 𝐹)) ∘𝑓 / (𝐺𝑓 · 𝐺)))
    < Previous  Next >

Page List
Jump to page: Contents  1 1-100 2 101-200 3 201-300 4 301-400 5 401-500 6 501-600 7 601-700 8 701-800 9 801-900 10 901-1000 11 1001-1100 12 1101-1200 13 1201-1300 14 1301-1400 15 1401-1500 16 1501-1600 17 1601-1700 18 1701-1800 19 1801-1900 20 1901-2000 21 2001-2100 22 2101-2200 23 2201-2300 24 2301-2400 25 2401-2500 26 2501-2600 27 2601-2700 28 2701-2800 29 2801-2900 30 2901-3000 31 3001-3100 32 3101-3200 33 3201-3300 34 3301-3400 35 3401-3500 36 3501-3600 37 3601-3700 38 3701-3800 39 3801-3900 40 3901-4000 41 4001-4100 42 4101-4200 43 4201-4300 44 4301-4400 45 4401-4500 46 4501-4600 47 4601-4700 48 4701-4800 49 4801-4900 50 4901-5000 51 5001-5100 52 5101-5200 53 5201-5300 54 5301-5400 55 5401-5500 56 5501-5600 57 5601-5700 58 5701-5800 59 5801-5900 60 5901-6000 61 6001-6100 62 6101-6200 63 6201-6300 64 6301-6400 65 6401-6500 66 6501-6600 67 6601-6700 68 6701-6800 69 6801-6900 70 6901-7000 71 7001-7100 72 7101-7200 73 7201-7300 74 7301-7400 75 7401-7500 76 7501-7600 77 7601-7700 78 7701-7800 79 7801-7900 80 7901-8000 81 8001-8100 82 8101-8200 83 8201-8300 84 8301-8400 85 8401-8500 86 8501-8600 87 8601-8700 88 8701-8800 89 8801-8900 90 8901-9000 91 9001-9100 92 9101-9200 93 9201-9300 94 9301-9400 95 9401-9500 96 9501-9600 97 9601-9700 98 9701-9800 99 9801-9900 100 9901-10000 101 10001-10100 102 10101-10200 103 10201-10300 104 10301-10400 105 10401-10500 106 10501-10600 107 10601-10700 108 10701-10800 109 10801-10900 110 10901-11000 111 11001-11100 112 11101-11200 113 11201-11300 114 11301-11400 115 11401-11500 116 11501-11600 117 11601-11700 118 11701-11800 119 11801-11900 120 11901-12000 121 12001-12100 122 12101-12200 123 12201-12300 124 12301-12400 125 12401-12500 126 12501-12600 127 12601-12700 128 12701-12800 129 12801-12900 130 12901-13000 131 13001-13100 132 13101-13200 133 13201-13300 134 13301-13400 135 13401-13500 136 13501-13600 137 13601-13700 138 13701-13800 139 13801-13900 140 13901-14000 141 14001-14100 142 14101-14200 143 14201-14300 144 14301-14400 145 14401-14500 146 14501-14600 147 14601-14700 148 14701-14800 149 14801-14900 150 14901-15000 151 15001-15100 152 15101-15200 153 15201-15300 154 15301-15400 155 15401-15500 156 15501-15600 157 15601-15700 158 15701-15800 159 15801-15900 160 15901-16000 161 16001-16100 162 16101-16200 163 16201-16300 164 16301-16400 165 16401-16500 166 16501-16600 167 16601-16700 168 16701-16800 169 16801-16900 170 16901-17000 171 17001-17100 172 17101-17200 173 17201-17300 174 17301-17400 175 17401-17500 176 17501-17600 177 17601-17700 178 17701-17800 179 17801-17900 180 17901-18000 181 18001-18100 182 18101-18200 183 18201-18300 184 18301-18400 185 18401-18500 186 18501-18600 187 18601-18700 188 18701-18800 189 18801-18900 190 18901-19000 191 19001-19100 192 19101-19200 193 19201-19300 194 19301-19400 195 19401-19500 196 19501-19600 197 19601-19700 198 19701-19800 199 19801-19900 200 19901-20000 201 20001-20100 202 20101-20200 203 20201-20300 204 20301-20400 205 20401-20500 206 20501-20600 207 20601-20700 208 20701-20800 209 20801-20900 210 20901-21000 211 21001-21100 212 21101-21200 213 21201-21300 214 21301-21400 215 21401-21500 216 21501-21600 217 21601-21700 218 21701-21800 219 21801-21900 220 21901-22000 221 22001-22100 222 22101-22200 223 22201-22300 224 22301-22400 225 22401-22500 226 22501-22600 227 22601-22700 228 22701-22800 229 22801-22900 230 22901-23000 231 23001-23100 232 23101-23200 233 23201-23300 234 23301-23400 235 23401-23500 236 23501-23600 237 23601-23700 238 23701-23800 239 23801-23900 240 23901-24000 241 24001-24100 242 24101-24200 243 24201-24300 244 24301-24400 245 24401-24500 246 24501-24600 247 24601-24700 248 24701-24800 249 24801-24900 250 24901-25000 251 25001-25100 252 25101-25200 253 25201-25300 254 25301-25400 255 25401-25500 256 25501-25600 257 25601-25700 258 25701-25800 259 25801-25900 260 25901-26000 261 26001-26100 262 26101-26200 263 26201-26300 264 26301-26400 265 26401-26500 266 26501-26600 267 26601-26700 268 26701-26800 269 26801-26900 270 26901-27000 271 27001-27100 272 27101-27200 273 27201-27300 274 27301-27400 275 27401-27500 276 27501-27600 277 27601-27700 278 27701-27800 279 27801-27900 280 27901-28000 281 28001-28100 282 28101-28200 283 28201-28300 284 28301-28400 285 28401-28500 286 28501-28600 287 28601-28700 288 28701-28800 289 28801-28900 290 28901-29000 291 29001-29100 292 29101-29200 293 29201-29300 294 29301-29400 295 29401-29500 296 29501-29600 297 29601-29700 298 29701-29800 299 29801-29900 300 29901-30000 301 30001-30100 302 30101-30200 303 30201-30300 304 30301-30400 305 30401-30500 306 30501-30600 307 30601-30700 308 30701-30800 309 30801-30900 310 30901-31000 311 31001-31100 312 31101-31200 313 31201-31300 314 31301-31400 315 31401-31500 316 31501-31600 317 31601-31700 318 31701-31800 319 31801-31900 320 31901-32000 321 32001-32100 322 32101-32200 323 32201-32300 324 32301-32400 325 32401-32500 326 32501-32600 327 32601-32700 328 32701-32800 329 32801-32900 330 32901-33000 331 33001-33100 332 33101-33200 333 33201-33300 334 33301-33400 335 33401-33500 336 33501-33600 337 33601-33700 338 33701-33800 339 33801-33900 340 33901-34000 341 34001-34100 342 34101-34200 343 34201-34300 344 34301-34400 345 34401-34500 346 34501-34600 347 34601-34700 348 34701-34800 349 34801-34900 350 34901-35000 351 35001-35100 352 35101-35200 353 35201-35300 354 35301-35400 355 35401-35500 356 35501-35600 357 35601-35700 358 35701-35800 359 35801-35900 360 35901-36000 361 36001-36100 362 36101-36200 363 36201-36300 364 36301-36400 365 36401-36500 366 36501-36600 367 36601-36700 368 36701-36800 369 36801-36900 370 36901-37000 371 37001-37100 372 37101-37200 373 37201-37300 374 37301-37400 375 37401-37500 376 37501-37600 377 37601-37700 378 37701-37800 379 37801-37900 380 37901-38000 381 38001-38100 382 38101-38200 383 38201-38300 384 38301-38400 385 38401-38500 386 38501-38600 387 38601-38700 388 38701-38800 389 38801-38900 390 38901-39000 391 39001-39100 392 39101-39200 393 39201-39300 394 39301-39400 395 39401-39500 396 39501-39600 397 39601-39700 398 39701-39800 399 39801-39900 400 39901-40000 401 40001-40100 402 40101-40200 403 40201-40300 404 40301-40400 405 40401-40500 406 40501-40600 407 40601-40700 408 40701-40800 409 40801-40900 410 40901-41000 411 41001-41100 412 41101-41200 413 41201-41300 414 41301-41400 415 41401-41500 416 41501-41600 417 41601-41700 418 41701-41800 419 41801-41900 420 41901-42000 421 42001-42100 422 42101-42200 423 42201-42300 424 42301-42316
  Copyright terms: Public domain < Previous  Next >