proposition: Lemma cons_case : forall l, l = nil \/ exists x l', l = x :: l'.
proof: Proof. Proof using. intros. destruct* l. Qed.
imports: Coq.Classes.Morphisms TLC(LibTactics LibLogic LibReflect LibOperation LibProd LibOption LibNat LibInt LibWf LibMonoid LibRelation)