(* predicate a is closed under "edge" relation e *)
Definition closed {T: finType} (e: rel T) (a: pred T) :=
  forall x y : T, e x y -> a x -> a y.

Lemma deriv_plus_eq_added (c: clause) (s1 s2: clauseset) (step1: trans s1 s2) (trace: deriv s2 s1) : added c step1 -> removes c trace.