Applies the ExistsRight-rule n times.
Applies the ExistsRight-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 right side of its bottommost sequent.
The rule:
(π) Γ :- Δ, A[x1\term1,...,xN\termN] ---------------------------------- (∀_l x n) Γ :- Δ, ∃ x1,..,xN.A
The top proof with (Γ :- Δ, A[x1\term1,...,xN\termN]) as the bottommost sequent.
A formula of the form (∃ 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 ExistsRight-rule n times.
Applies the ExistsRight-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 right side of its bottommost sequent.
The rule:
(π) Γ :- Δ, A[x1\term1,...,xN\termN] ---------------------------------- (∀_l x n) Γ :- Δ, ∃ x1,..,xN.A
The top proof with (Γ :- Δ, A[x1\term1,...,xN\termN]) as the bottommost sequent.
A formula of the form (∃ 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.