discriminate sterm

discriminate p

Pre-conditions:

p must have type K t1 ... tn = K' t'1 ... t'm where K and K' must be different constructors of the same inductive type and each argument list can be empty if its constructor takes no arguments.

Action:

It closes the current sequent by proving the absurdity of p.

New sequents to prove:

None.