-- File: optlib/Optlib/Algorithm/LASSO.lean
Theorem statement:
theorem extracted_formal_statement_14 {n m : ℕ+} {A : Matrix (Fin ↑m) (Fin ↑n) ℝ} :
  let normA := ‖(toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖;
  (∀ (x : EuclideanSpace ℝ (Fin ↑n)), ‖A *ᵥ x‖ ≤ normA * ‖x‖) → normA ≤ 0 → 0 ≤ normA := sorry

Tactic state before:
n m : ℕ+
A : Matrix (Fin ↑m) (Fin ↑n) ℝ
x : EuclideanSpace ℝ (Fin ↑n)
ε : ℝ
εpos : ε > 0
normA : ℝ := ‖(toEuclideanLin ≪≫ₗ LinearMap.toContinuousLinearMap) A‖
norm_mul : ∀ (x : EuclideanSpace ℝ (Fin ↑n)), ‖A *ᵥ x‖ ≤ normA * ‖x‖
hA : normA ≤ 0
⊢ 0 ≤ normA

Tactic: apply norm_nonneg

Tactic state after:

Premises used:
norm_nonneg : ∀ {E : Type u_5} [inst : SeminormedAddGroup E] (a : E), 0 ≤ ‖a‖