Theorem: LO.System.FiniteContext.weakening! (Logic/Logic/HilbertStyle/Context.lean)

State before:
F : Type u_1
inst✝³ : LogicalConnective F
inst✝² : DecidableEq F
S : Type u_2
inst✝¹ : System F S
𝓢 : S
inst✝ : Minimal 𝓢
Γ Δ E : List F
h✝ : Γ ⊆ Δ
p : F
h : Γ ⊢[𝓢]! p
⊢ { ctx := Γ } ⊆ { ctx := Δ }
Tactic:
simpa
State after:
no goals