-- File: FoML/FoML/Rademacher.lean
Theorem statement:
theorem extracted_formal_statement_41.{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 < ⊤) (hfle : ∀ (i : ι), ∀ᵐ (x : α) ∂μ, f i x < ⊤)
  (hfne : ∀ᵐ (x : α) ∂μ, ∀ (i : ι), f i x ≠ ⊤) (hb' : b * μ Set.univ < ⊤) (hf_nebot : ⨆ i, ∫⁻ (a : α), f i a ∂μ ≠ ⊤) :
  b * μ Set.univ ≤ b * μ Set.univ := sorry

Tactic state before:
α : 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 < ⊤
hfle : ∀ (i : ι), ∀ᵐ (x : α) ∂μ, f i x < ⊤
hfne : ∀ᵐ (x : α) ∂μ, ∀ (i : ι), f i x ≠ ⊤
hb' : b * μ Set.univ < ⊤
hf_nebot : ⨆ i, ∫⁻ (a : α), f i a ∂μ ≠ ⊤
⊢ b * μ Set.univ ≤ b * μ Set.univ

Tactic: apply le_refl

Tactic state after:

Premises used:
le_refl : ∀ {α : Type u_1} [inst : Preorder α] (a : α), a ≤ a