-- File: FoML/FoML/ForMathlib/Probability/Moments.lean
Theorem statement:
theorem extracted_formal_statement_61.{u_1} {Ω : Type u_1} {m : MeasurableSpace Ω} {μ : Measure Ω}
  [inst : IsFiniteMeasure μ] (t a b : ℝ) {X : Ω → ℝ} (hX : AEMeasurable X μ) (h_1 : ∀ᵐ (ω : Ω) ∂μ, X ω ∈ Set.Icc a b) :
  let c := ‖a‖ ⊔ ‖b‖;
  ∀ (ω : Ω), X ω ∈ Set.Icc a b → |t| * |X ω| ≤ |t| * c → 0 ≤ |t| := sorry

Tactic state before:
Ω : Type u_1
m : MeasurableSpace Ω
μ : Measure Ω
inst✝ : IsFiniteMeasure μ
t a b : ℝ
X : Ω → ℝ
hX : AEMeasurable X μ
h✝ : ∀ᵐ (ω : Ω) ∂μ, X ω ∈ Set.Icc a b
c : ℝ := ‖a‖ ⊔ ‖b‖
e : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω
e' : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω ^ 2
ω : Ω
h : X ω ∈ Set.Icc a b
⊢ |t| * |X ω| ≤ |t| * c

Tactic: apply mul_le_mul_of_nonneg_left

Tactic state after:
[case h
 Ω : Type u_1
 m : MeasurableSpace Ω
 μ : Measure Ω
 inst✝ : IsFiniteMeasure μ
 t a b : ℝ
 X : Ω → ℝ
 hX : AEMeasurable X μ
 h✝ : ∀ᵐ (ω : Ω) ∂μ, X ω ∈ Set.Icc a b
 c : ℝ := ‖a‖ ⊔ ‖b‖
 e : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω
 e' : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω ^ 2
 ω : Ω
 h : X ω ∈ Set.Icc a b
 ⊢ |X ω| ≤ c,
 case a0
 Ω : Type u_1
 m : MeasurableSpace Ω
 μ : Measure Ω
 inst✝ : IsFiniteMeasure μ
 t a b : ℝ
 X : Ω → ℝ
 hX : AEMeasurable X μ
 h✝ : ∀ᵐ (ω : Ω) ∂μ, X ω ∈ Set.Icc a b
 c : ℝ := ‖a‖ ⊔ ‖b‖
 e : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω
 e' : ℝ → Ω → ℝ := fun t ω => rexp (t * X ω) * X ω ^ 2
 ω : Ω
 h : X ω ∈ Set.Icc a b
 ⊢ 0 ≤ |t|]

Premises used:
mul_le_mul_of_nonneg_left : ∀ {α : Type u_3} {a b c : α} [inst : Mul α] [inst_1 : Zero α] [inst_2 : Preorder α]
  [inst_3 : PosMulMono α], b ≤ c → 0 ≤ a → a * b ≤ a * c