theorem extracted_formal_statement_194 {n m : ℕ+} {A : Matrix (Fin ↑m) (Fin ↑n) ℝ} {Ane0 : A ≠ 0} : ¬A = 0 := sorry

State before:
n m : ℕ+
A : Matrix (Fin ↑m) (Fin ↑n) ℝ
b : Fin ↑m → ℝ
μ : ℝ
μpos : 0 < μ
Ane0 : A ≠ 0
x₀ : EuclideanSpace ℝ (Fin ↑n)
p : LASSO A b μ μpos Ane0 x₀
⊢ ¬A = 0

Tactic: exact Ane0

State after:

Relevant lemmas: