-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_31.{u_3, u_2} {α : Type u_2} [inst : MeasurableSpace α] (μ : Measure α)
  [inst_1 : IsFiniteMeasure μ] {ι : Sort u_3} [inst_2 : Countable ι] (f : ι → α → ℝ≥0∞)
  (hfm : ∀ (i : ι), Measurable (f i)) {b : ℝ≥0∞} (hb : b ≠ ⊤) (hf : ∀ (i : ι) (x : α), f i x ≤ b)
  (hf_le : ∀ (i : ι) (x : α), f i x < ⊤) (i : ι) (x : α) : f i x < ⊤ := sorry

Tactic state before:
case h
α : Type u_2
inst✝² : MeasurableSpace α
μ : Measure α
inst✝¹ : IsFiniteMeasure μ
ι : Sort u_3
inst✝ : Countable ι
f : ι → α → ℝ≥0∞
hfm : ∀ (i : ι), Measurable (f i)
b : ℝ≥0∞
hb : b ≠ ⊤
hf : ∀ (i : ι) (x : α), f i x ≤ b
hf_le : ∀ (i : ι) (x : α), f i x < ⊤
i : ι
x : α
⊢ f i x < ⊤

Tactic: exact lt_top_of_lt (hf_le i x)

Tactic state after:

Premises used:
lt_top_of_lt : ∀ {α : Type u} [inst : Preorder α] [inst_3 : OrderTop α] {a b : α}, a < b → a < ⊤