Theorem: LO.FirstOrder.Rew.hom_fix_free (Logic/FirstOrder/Basic/Syntax/Rew.lean)

State before:
L : Language
L₁ : Language
L₂ : Language
L₃ : Language
ξ : Type u_1
ξ₁ : Type u_2
ξ₂ : Type u_3
ξ₃ : Type u_4
n n₁ n₂✝ n₂ m m₁ m₂ m₃ : ℕ
p : SyntacticSemiformula L (n + 1)
⊢ (hom fix) ((hom free) p) = p
Tactic:
simp[←hom_comp_app]
State after:
no goals