-- File: FoML/FoML/Bennett.lean
Theorem statement:
theorem extracted_formal_statement_7 (x : ℝ) (hx : |x| ≤ 1) (hx_le_1 : x ≤ 1) (u : ℝ) (hu : u ∈ interior (Ici 0))
  (h_original_goal : rexp (u * x) * x * x ≤ x ^ 2 * rexp u) : x ^ 2 * rexp (u * x) ≤ x ^ 2 * rexp u := sorry

Tactic state before:
case a.a
x τ : ℝ
hx : |x| ≤ 1
hτ : 0 ≤ τ
hx_le_1 : x ≤ 1
f : ℝ → ℝ := fun τ => rexp (τ * x) - (1 + τ * x + x ^ 2 * (rexp τ - 1 - τ))
f' : ℝ → ℝ := fun τ => rexp (τ * x) * x - (x + x ^ 2 * (rexp τ - 1))
f'' : ℝ → ℝ := fun τ => rexp (τ * x) * x * x - x ^ 2 * rexp τ
hf0 : f 0 = 0
hf'0 : f' 0 = 0
t : ℝ
ht : t ∈ interior (Ici 0)
u : ℝ
hu : u ∈ interior (Ici 0)
⊢ rexp (u * x) * x * x ≤ x ^ 2 * rexp u

Tactic: rw [mul_assoc, ← sq, mul_comm (rexp _)]

Tactic state after:
[case a.a
 x τ : ℝ
 hx : |x| ≤ 1
 hτ : 0 ≤ τ
 hx_le_1 : x ≤ 1
 f : ℝ → ℝ := fun τ => rexp (τ * x) - (1 + τ * x + x ^ 2 * (rexp τ - 1 - τ))
 f' : ℝ → ℝ := fun τ => rexp (τ * x) * x - (x + x ^ 2 * (rexp τ - 1))
 f'' : ℝ → ℝ := fun τ => rexp (τ * x) * x * x - x ^ 2 * rexp τ
 hf0 : f 0 = 0
 hf'0 : f' 0 = 0
 t : ℝ
 ht : t ∈ interior (Ici 0)
 u : ℝ
 hu : u ∈ interior (Ici 0)
 ⊢ x ^ 2 * rexp (u * x) ≤ x ^ 2 * rexp u]

Premises used:
mul_comm : ∀ {G : Type u_1} [inst : CommMagma G] (a b : G), a * b = b * a
sq : ∀ {M : Type u_2} [inst : Monoid M] (a : M), a ^ 2 = a * a
mul_assoc : ∀ {G : Type u_1} [inst : Semigroup G] (a b c : G), a * b * c = a * (b * c)