-
Notifications
You must be signed in to change notification settings - Fork 1
Open
Description
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 }Reactions are currently unavailable
Metadata
Metadata
Assignees
Labels
No labels