theorem extracted_formal_statement_10 {n m : ℕ+} {A : Matrix (Fin ↑m) (Fin ↑n) ℝ} (hA : A = 0)
  (x : EuclideanSpace ℝ (Fin ↑n)) (h_original_goal : HasGradientAt (fun x => 0 *ᵥ x ⬝ᵥ 0 *ᵥ x) (2 • 0ᵀ *ᵥ 0 *ᵥ x) x) :
  HasGradientAt (fun x => 0) 0 x := sorry

State before:
case pos
n m : ℕ+
A : Matrix (Fin ↑m) (Fin ↑n) ℝ
hA : A = 0
x : EuclideanSpace ℝ (Fin ↑n)
⊢ HasGradientAt (fun x => 0 *ᵥ x ⬝ᵥ 0 *ᵥ x) (2 • 0ᵀ *ᵥ 0 *ᵥ x) x

Tactic: simp

State after:
[case pos
 n m : ℕ+
 A : Matrix (Fin ↑m) (Fin ↑n) ℝ
 hA : A = 0
 x : EuclideanSpace ℝ (Fin ↑n)
 ⊢ HasGradientAt (fun x => 0) 0 x]

Relevant lemmas: