Replaces a formula term2 with the disjunction term1 v term2 in the succedent of a sequent. If term1 occurs more than once, only one occurrence is replaced. The rule: (rest of s1) sL |- sR, term2 ----------------------- (OrRight2) sL |- sR, term1 v term2
Replaces a formula term2 with the disjunction term1 v term2 in the succedent of a sequent. If term1 occurs more than once, only one occurrence is replaced. The rule: (rest of s1) sL |- sR, term2 ----------------------- (OrRight2) sL |- sR, term1 v term2
The top proof with (sL |- sR, term2) as the bottommost sequent.
The new term to add.
The term to be replaced by the new disjunction.
An LK Proof ending with the new inference.
Replaces a formula F (marked by term2oc) with the disjunction term1 v F in the succedent of a sequent.
Replaces a formula F (marked by term2oc) with the disjunction term1 v F in the succedent of a sequent. This function merely returns a sequent, not a proof.
The sequent (sL |- sR, F).
The new term to add.
The occurrence of F in the succedent of s1.
The sequent (sL |- sR, term1 v F).
Replaces a formula F (marked by term2oc) with the disjunction term1 v F in the succcedent of a sequent. The rule: (rest of s1) sL |- sR, F ------------------- (OrRight2) sL |- sR, term1 v F
Replaces a formula F (marked by term2oc) with the disjunction term1 v F in the succcedent of a sequent. The rule: (rest of s1) sL |- sR, F ------------------- (OrRight2) sL |- sR, term1 v F
The top proof with (sL |- sR, F) as the bottommost sequent.
The new term to add.
The occurrence of F in the succedent of s1.
An LK Proof ending with the new inference.
Returns the right subformula.
Returns the right subformula.
A formula of the form l Or r
r.