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