-- File: FoML/FoML/Symmetrization.lean
Theorem statement:
theorem extracted_formal_statement_223.{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)))
  (h_original_goal : ⨆ i, V (if (↑i.1 == 0) = true then f i.2 else -f i.2) ≤ ⨆ i, |V (f i)|) (x : Fin 2 × ι) :
  V (if (↑x.1 == 0) = true then f x.2 else -f x.2) ≤ ⨆ i, |V (f i)| := sorry

Tactic state before:
case a
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 (if (↑i.1 == 0) = true then f i.2 else -f i.2) ≤ ⨆ i, |V (f i)|

Tactic: apply ciSup_le

Tactic 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))
 ⊢ ∀ (x : Fin 2 × ι), V (if (↑x.1 == 0) = true then f x.2 else -f x.2) ≤ ⨆ i, |V (f i)|]

Premises used:
ciSup_le : ∀ {α : Type u_1} {ι : Sort u_4} [inst : ConditionallyCompleteLattice α] [inst_1 : Nonempty ι] {f : ι → α}
  {c : α}, (∀ (x : ι), f x ≤ c) → iSup f ≤ c