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

Tactic state before:
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|

Tactic: exact le_trans' (le_abs_self (max ‖a‖ ‖b‖)) (abs_le_max_abs_abs h.1 h.2)

Tactic state after:

Premises used:
abs_le_max_abs_abs : ∀ {G : Type u_1} [inst : LinearOrderedAddCommGroup G] {a b c : G}, a ≤ b → b ≤ c → |b| ≤ |a| ⊔ |c|
le_trans' : ∀ {α : Type u_2} [inst : Preorder α] {a b c : α}, b ≤ c → a ≤ b → a ≤ c
le_abs_self : ∀ {α : Type u_1} [inst : Lattice α] [inst_1 : AddGroup α] (a : α), a ≤ |a|