Theorem: LO.FirstOrder.Derivation.ProofList.sequents_append (Logic/FirstOrder/Computability/Calculus.lean)

State before:
μ : Type ?u.465354
L : Language
inst✝⁶ : (k : ℕ) → DecidableEq (L.Func k)
inst✝⁵ : (k : ℕ) → DecidableEq (L.Rel k)
inst✝⁴ : (k : ℕ) → Primcodable (L.Func k)
inst✝³ : (k : ℕ) → Primcodable (L.Rel k)
inst✝² : UniformlyPrimcodable L.Func
inst✝¹ : UniformlyPrimcodable L.Rel
inst✝ : Primcodable μ
l₁ l₂ : ProofList L
⊢ (l₁ ++ l₂).sequents = l₁.sequents ++ l₂.sequents
Tactic:
simp[sequents]
State after:
no goals