Applies the ExistsLeft-rule n times.
Applies the ExistsLeft-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\y1,...,xN\yN], Γ :- Δ ---------------------------------- (∀_r x n) ∃x1,..,xN.A, Γ :- Δ where y1,...,yN are eigenvariables.
The proof π with (A[x1\y1,...,xN\yN], Γ :- Δ) as the bottommost sequent.
A formula of the form (∃ x1,...,xN.A).
The list of eigenvariables with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\y1,...,xN\yN] indeed occurs at the bottom of the proof π.
Applies the ExistsLeft-rule n times.
Applies the ExistsLeft-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\y1,...,xN\yN], Γ :- Δ ---------------------------------- (∀_r x n) ∃x1,..,xN.A, Γ :- Δ where y1,...,yN are eigenvariables.
The proof π with (A[x1\y1,...,xN\yN], Γ :- Δ) as the bottommost sequent.
A formula of the form (∃ x1,...,xN.A).
The list of eigenvariables with which to instantiate main. The caller of this method has to ensure the correctness of these terms, and, specifically, that A[x1\y1,...,xN\yN] indeed occurs at the bottom of the proof π.
A pair consisting of an LKProof and an OccConnector.