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

State before:
μ : Type ?u.896686
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 μ
c : Code L
Γ : List (SyntacticFormula L)
l : ProofList L
⊢ sequents ((c, Γ) :: l) = Γ :: l.sequents
Tactic:
simp[sequents]
State after:
no goals