Theorem: LO.FirstOrder.Arith.Model.Bounded₂.comp (Arithmetization/Definability/Definability.lean)

State before:
L : Language
inst✝⁹ : L.ORing
ξ : Type u_1
n : ℕ
M : Type u_2
inst✝⁸ : Zero M
inst✝⁷ : One M
inst✝⁶ : Add M
inst✝⁵ : Mul M
inst✝⁴ : LT M
inst✝³ : M ⊧ₘ* 𝐏𝐀⁻
inst✝² : Structure L M
inst✝¹ : Structure.ORing L M
inst✝ : Structure.Monotone L M
Γ : HierarchySymbol
f : M → M → M
k : ℕ
g₁ g₂ : (Fin k → M) → M
hf : Bounded₂ L f
hg₁ : Bounded L g₁
hg₂ : Bounded L g₂
i : Fin (Nat.succ 0).succ
⊢ Bounded L (![g₁, g₂] i)
Tactic:
cases i using Fin.cases <;> simp [*]
State after:
no goals