Replaces a formulas term1, term2 with the conjunction term1 ∧ term2 in the antecedent of a sequent. The rule: (rest of s1) sL, term1, term2 |- sR ---------------------- (AndLeft) sL, term1 ∧ term2 |- sR
Replaces a formulas term1, term2 with the conjunction term1 ∧ term2 in the antecedent of a sequent. The rule: (rest of s1) sL, term1, term2 |- sR ---------------------- (AndLeft) sL, term1 ∧ term2 |- sR
The top proof with (sL, term1, term2 |- sR) as the bottommost sequent.
The first formula to be replaced in the antecedent of s1.
The second formula to be replaced in the antecedent of s2.
An LK Proof ending with the new inference.
Replaces a formulas A, B (marked by term1oc & term2oc) with the conjunction A ∧ B in the antecedent of a sequent. The rule: (rest of s1) sL, A, B |- sR ------------------- (AndLeft) sL, A ∧ B |- sR
Replaces a formulas A, B (marked by term1oc & term2oc) with the conjunction A ∧ B in the antecedent of a sequent. The rule: (rest of s1) sL, A, B |- sR ------------------- (AndLeft) sL, A ∧ B |- sR
The top proof with (sL, A, B |- sR) as the bottommost sequent.
The occurrence of A in the antecedent of s1.
The occurrence of B in the antecedent of s2.
An LK Proof ending with the new inference.