Theorem: LO.FirstOrder.UFormula.qeq (Logic/FirstOrder/Computability/Formula.lean)

State before:
L : Language
μ : Type v
inst✝⁴ : (k : ℕ) → Primcodable (L.Func k)
inst✝³ : (k : ℕ) → Primcodable (L.Rel k)
inst✝² : UniformlyPrimcodable L.Func
inst✝¹ : UniformlyPrimcodable L.Rel
inst✝ : Primcodable μ
α : Sort u_1
a b c d : α
h₁ : a = b
h₂ : b = c
h₃ : c = d
⊢ a = d
Tactic:
simp[*]
State after:
no goals