exact Redux.antimonotone (by assumption)
case redux
L : Language
inst✝³ : (k : ℕ) → DecidableEq (L.Func k)
inst✝² : (k : ℕ) → DecidableEq (L.Rel k)
inst✝¹ : (k : ℕ) → Encodable (L.Func k)
inst✝ : (k : ℕ) → Encodable (L.Rel k)
T : Theory L
Γ : Sequent L
s : ℕ
Δ₂ Δ₁ : Sequent L
c✝ : Code L
a✝¹ : decode s.unpair.1 = some c✝
a✝ : Δ₂ ≺[c✝] Δ₁
⊢ Δ₁ ⊆ Δ₂
no goals