theorem extracted_formal_statement_219.{w, v} {Z : Type w} {ι : Type v} {f : ι → Z → ℝ} [inst : Nonempty ι]
  {V : (Z → ℝ) → ℝ} (hV₀ : ∀ (f : Z → ℝ), V (-f) = -V f) (hV₁ : BddAbove (Set.range fun i => |V (f i)|))
  (hV₁' : BddAbove (Set.range fun i => V (if (↑i.1 == 0) = true then f i.2 else -f i.2))) (i : ι)
  (h_original_goal : |V (f i)| ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2)) :
  V (f i) ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2) ∧
    -V (f i) ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2) := sorry

State before:
case a.H
Z : Type w
ι : Type v
f : ι → Z → ℝ
inst✝ : Nonempty ι
V : (Z → ℝ) → ℝ
hV₀ : ∀ (f : Z → ℝ), V (-f) = -V f
hV₁ : BddAbove (Set.range fun i => |V (f i)|)
hV₁' : BddAbove (Set.range fun i => V (if (↑i.1 == 0) = true then f i.2 else -f i.2))
i : ι
⊢ |V (f i)| ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2)

Tactic: apply abs_le'.mpr

State after:
[case a.H
 Z : Type w
 ι : Type v
 f : ι → Z → ℝ
 inst✝ : Nonempty ι
 V : (Z → ℝ) → ℝ
 hV₀ : ∀ (f : Z → ℝ), V (-f) = -V f
 hV₁ : BddAbove (Set.range fun i => |V (f i)|)
 hV₁' : BddAbove (Set.range fun i => V (if (↑i.1 == 0) = true then f i.2 else -f i.2))
 i : ι
 ⊢ V (f i) ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2) ∧
     -V (f i) ≤ ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2)]

Relevant lemmas: