. apply iff_provable_list_conj.mpr;
  intro p hp;
  exact d p (by simp; right; exact hp);
case h.d₂
F : Type u_1
inst✝⁴ : LogicalConnective F
inst✝³ : DecidableEq F
S : Type u_2
inst✝² : System F S
𝓢 : S
inst✝¹ : Minimal 𝓢
p q r : F
Γ Δ : List F
inst✝ : System.NegationEquiv 𝓢
this : [(Γ ++ Δ).conj'] ⊢[𝓢]! (Γ ++ Δ).conj'
d : ∀ p ∈ Γ ++ Δ, { ctx := [(Γ ++ Δ).conj'] } ⊢! p
⊢ { ctx := [(Γ ++ Δ).conj'] } ⊢! Δ.conj'
no goals