In Coq, I can write something like:
Lemma lastP s : last_spec s.
Proof. case: s => [|x s]; [left | rewrite lastI; right]. Qed.
Is there something similar in Ssrlean?
Currently I do the following, which is a bit verbose:
theorem lastP (s : Seq α) : last_spec s := by
scase: s => [|x s]
{ left }
{ srw lastI; right }
In Coq, I can write something like:
Is there something similar in Ssrlean?
Currently I do the following, which is a bit verbose: