Theorem: LO.FirstOrder.Semiterm.Operator.operator_foldr_cons (Logic/FirstOrder/Basic/Operator.lean)

State before:
L : Language
k : ℕ
ξ : Type u_1
n : ℕ
f : Operator L 2
z o : Operator L k
os : List (Operator L k)
v : Fin k → Semiterm L ξ n
⊢ (f.foldr z (o :: os)).operator v = f.operator ![(f.foldr z os).operator v, o.operator v]
Tactic:
simp [foldr, operator_comp, Matrix.fun_eq_vec₂]
State after:
no goals