An LKProof containing the instances in et in its end sequent
A ExpansionTree whose shallow formula is prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep formula of met.
An LKProof containing the instances in es in its end sequent.
An ExpansionSequent in which all shallow formulas are prenex and which contains no strong or Skolem quantifiers.
A proof starting with s1 and ending with the deep sequent of es.
Computes a proof of F from a proof of some instances of F