Replaces a formula term1 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, term1 ----------------------- (OrRight1) sL |- sR, term1 v term2
Replaces a formula term1 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, term1 ----------------------- (OrRight1) sL |- sR, term1 v term2
The top proof with (sL |- sR, term1) as the bottommost sequent.
The term to be replaced by the new disjunction.
The new term to add.
An LK Proof ending with the new inference.
Replaces a formula F (marked by term1oc) with the disjunction F v term2 in the succedent of a sequent.
Replaces a formula F (marked by term1oc) with the disjunction F v term2 in the succedent of a sequent. This function merely returns a sequent, not a proof.
The sequent (sL |- sR, F).
The occurrence of F in the succedent of s1.
The new term to add.
The sequent (sL |- sR, F v term2).
Replaces a formula F (marked by term1oc) with the disjunction F v term2 in the succcedent of a sequent. The rule: (rest of s1) sL |- sR, F ------------------- (OrRight1) sL |- sR, F v term2
Replaces a formula F (marked by term1oc) with the disjunction F v term2 in the succcedent of a sequent. The rule: (rest of s1) sL |- sR, F ------------------- (OrRight1) sL |- sR, F v term2
The top proof with (sL |- sR, F) as the bottommost sequent.
The occurrence of F in the succedent of s1.
The new term to add.
An LK Proof ending with the new inference.
Returns the left subformula.
Returns the left subformula.
A formula of the form l Or r
l.