Applies the ForallLeft-rule n times.
Applies the ForallLeft-rule n times. This method expects a formula main with a quantifier block, and a proof s1 which has a fully instantiated version of main on the left side of its bottommost sequent.
The rule:
(π) A[x1\term1,...,xN\termN], Γ :- Δ ---------------------------------- (∀_l x n) ∀ x1,..,xN.A, Γ :- Δ
The top proof with (sL, A[x1\term1,...,xN\termN] :- sR) as the bottommost sequent.
A formula of the form (Forall x1,...,xN.A).
The list of terms with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\term1,...,xN\termN] indeed occurs at the bottom of the proof π.
Applies the ForallLeft-rule n times.
Applies the ForallLeft-rule n times. This method expects a formula main with a quantifier block, and a proof s1 which has a fully instantiated version of main on the left side of its bottommost sequent.
The rule:
(π) A[x1\term1,...,xN\termN], Γ :- Δ ---------------------------------- (∀_l x n) ∀ x1,..,xN.A, Γ :- Δ
The top proof with (sL, A[x1\term1,...,xN\termN] :- sR) as the bottommost sequent.
A formula of the form (Forall x1,...,xN.A).
The list of terms with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\term1,...,xN\termN] indeed occurs at the bottom of the proof π.
A pair consisting of an LKProof and an OccConnector.