Performs a proof employing transitivity. Takes a proof π with end-sequent of the form (x=z), Trans, ... |- ... and return one with end-sequent of the form (x=y), (y=z), Trans, ... |- ... where Trans is defined as Forall xyz.((x=y ∧ y=z) -> x=z)
Performs a proof employing transitivity. Takes a proof π with end-sequent of the form (x=z), Trans, ... |- ... and return one with end-sequent of the form (x=y), (y=z), Trans, ... |- ... where Trans is defined as Forall xyz.((x=y ∧ y=z) -> x=z)
X
Y
Z
The proof π which contains the (x=z) which is to be shown.
A proof with π as a subtree and the formula (x=z) replaced by (x=y) and (y=z).