theorem extracted_formal_statement_11 (a b : ℝ) (hab : b > a) : 0 < (b - a) ^ 2 := sorry

State before:
case hb.ha
ε a b : ℝ
m : ℕ
hm : m > 0
hε : ε > 0
hab : b > a
g : { t // t > 0 } → ℝ := fun t => -↑t * ε + ↑t ^ 2 * ↑m * (b - a) ^ 2 / 8
⊢ 0 < (b - a) ^ 2

Tactic: exact sq_pos_of_ne_zero (ne_of_gt (sub_pos.mpr hab))

State after:

Relevant lemmas:
sq_pos_of_ne_zero : ∀ {R : Type u_3} [inst : LinearOrderedSemiring R] [inst_1 : ExistsAddOfLE R] {a : R},
  a ≠ 0 → 0 < a ^ 2
ne_of_gt : ∀ {α : Type u_1} [inst : Preorder α] {a b : α}, b < a → a ≠ b