'PHI.Monographs.Bernstein.choose_real_factorial' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.choose_real_factorial (n k : ℕ) (hk : k ≤ n) :
  ↑(n.choose k) = ↑n.factorial / (↑k.factorial * ↑(n - k).factorial)
'PHI.Monographs.Bernstein.weighted_convex_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weighted_convex_bounds.{u_1} {ι : Type u_1} (s : Finset ι) (w c : ι → ℝ) (lo hi : ℝ)
  (hw : ∀ i ∈ s, 0 ≤ w i) (hs : ∑ i ∈ s, w i = 1) (hc : ∀ i ∈ s, lo ≤ c i ∧ c i ≤ hi) :
  lo ≤ ∑ i ∈ s, w i * c i ∧ ∑ i ∈ s, w i * c i ≤ hi
'PHI.Monographs.Bernstein.empty_weights_not_normalized' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.empty_weights_not_normalized.{u_1} {ι : Type u_1} (w : ι → ℝ) : ∑ i ∈ ∅, w i ≠ 1
'PHI.Monographs.Bernstein.weight_nonnegative' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weight_nonnegative (n k : ℕ) (t : ℝ) (ht0 : 0 ≤ t) (ht1 : t ≤ 1) :
  0 ≤ PHI.Monographs.Bernstein.weight n k t
'PHI.Monographs.Bernstein.weights_partition_unity' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.weights_partition_unity (n : ℕ) (t : ℝ) :
  ∑ k ∈ Finset.range (n + 1), PHI.Monographs.Bernstein.weight n k t = 1
'PHI.Monographs.Bernstein.bernstein_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.bernstein_bounds (n : ℕ) (c : ℕ → ℝ) (t lo hi : ℝ) (ht0 : 0 ≤ t) (ht1 : t ≤ 1)
  (hc : ∀ k < n + 1, lo ≤ c k ∧ c k ≤ hi) :
  lo ≤ PHI.Monographs.Bernstein.value n c t ∧ PHI.Monographs.Bernstein.value n c t ≤ hi
'PHI.Monographs.Bernstein.degree_zero_value' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.degree_zero_value (c : ℕ → ℝ) (t : ℝ) : PHI.Monographs.Bernstein.value 0 c t = c 0
'PHI.Monographs.Bernstein.affine_parameter_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.affine_parameter_bounds (a b x : ℝ) (hab : a < b) (hx : a ≤ x ∧ x ≤ b) :
  0 ≤ (x - a) / (b - a) ∧ (x - a) / (b - a) ≤ 1
'PHI.Monographs.Bernstein.affine_reconstruction' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.affine_reconstruction (a b x : ℝ) (hab : a < b) : a + (b - a) * ((x - a) / (b - a)) = x
'PHI.Monographs.Bernstein.bernstein_interval_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.bernstein_interval_bounds (n : ℕ) (c : ℕ → ℝ) (f : ℝ → ℝ) (a b lo hi : ℝ) (hab : a < b)
  (hc : ∀ k < n + 1, lo ≤ c k ∧ c k ≤ hi)
  (hidentity : ∀ (t : ℝ), 0 ≤ t → t ≤ 1 → f (a + (b - a) * t) = PHI.Monographs.Bernstein.value n c t) (x : ℝ) :
  a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
'PHI.Monographs.Bernstein.empty_chain_cannot_cover' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.empty_chain_cannot_cover (f : ℝ → ℝ) (lo hi a b : ℝ) (hab : a < b) :
  ¬PHI.Monographs.Bernstein.intervalChain f lo hi a b []
'PHI.Monographs.Bernstein.contiguous_chain_bounds' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.contiguous_chain_bounds (f : ℝ → ℝ) (lo hi : ℝ) (points : List ℝ) (a b : ℝ) :
  a < b → PHI.Monographs.Bernstein.intervalChain f lo hi a b points → ∀ (x : ℝ), a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
'PHI.Monographs.Bernstein.certified_chain_implies_interval_chain' depends on axioms: [propext,
 Classical.choice,
 Quot.sound]
PHI.Monographs.Bernstein.certified_chain_implies_interval_chain (f : ℝ → ℝ) (lo hi : ℝ)
  (segments : List PHI.Monographs.Bernstein.Segment) (a b : ℝ) :
  PHI.Monographs.Bernstein.certifiedChain f lo hi a b segments →
    PHI.Monographs.Bernstein.intervalChain f lo hi a b (List.map PHI.Monographs.Bernstein.Segment.right segments)
'PHI.Monographs.Bernstein.certified_chain_sound' depends on axioms: [propext, Classical.choice, Quot.sound]
PHI.Monographs.Bernstein.certified_chain_sound (f : ℝ → ℝ) (lo hi a b : ℝ)
  (segments : List PHI.Monographs.Bernstein.Segment) (hab : a < b)
  (hcert : PHI.Monographs.Bernstein.certifiedChain f lo hi a b segments) (x : ℝ) : a ≤ x → x ≤ b → lo ≤ f x ∧ f x ≤ hi
