cases hq with
| inl h => subst h; simp;
| inr h => simp; right; exact hΓ q h;
α : Type u_1
inst✝² : DecidableEq α
inst✝¹ : Inhabited α
L : DeductionParameter α
inst✝ : L.Normal
T : Theory α
p : Formula α
h : (L)-Consistent insert p T
Γ : List (Formula α)
hΓ : ∀ q ∈ Γ, q ∈ T
hC : L ⊢! p ⋏ Γ.conj' ⟶ ⊥
q : Formula α
hq : q = p ∨ q ∈ Γ
⊢ q ∈ insert p T
no goals