-- File: optlib/Optlib/Algorithm/LASSO.lean
Theorem statement:
theorem extracted_formal_statement_74 {n m : ℕ+} {b : Fin ↑m → ℝ} {A : Matrix (Fin ↑m) (Fin ↑n) ℝ}
  (x : EuclideanSpace ℝ (Fin ↑n)) (a : x ∈ Set.univ) (y : EuclideanSpace ℝ (Fin ↑n)) (a_1 : y ∈ Set.univ) :
  ‖A *ᵥ (x - y)‖ ^ 2 ≥ 0 := sorry

Tactic state before:
case mono
n m : ℕ+
b : Fin ↑m → ℝ
A : Matrix (Fin ↑m) (Fin ↑n) ℝ
x : EuclideanSpace ℝ (Fin ↑n)
a✝¹ : x ∈ Set.univ
y : EuclideanSpace ℝ (Fin ↑n)
a✝ : y ∈ Set.univ
⊢ ‖A *ᵥ (x - y)‖ ^ 2 ≥ 0

Tactic: apply sq_nonneg

Tactic state after:

Premises used:
sq_nonneg : ∀ {α : Type u} [inst : Semiring α] [inst_1 : LinearOrder α] [inst_2 : IsRightCancelAdd α]
  [inst_3 : ZeroLEOneClass α] [inst_4 : ExistsAddOfLE α] [inst_5 : PosMulMono α] [inst_6 : AddLeftStrictMono α] (a : α),
  0 ≤ a ^ 2