proposition: Lemma in_hd_tl X n (v : Vector.t X (S (S n))) : Vector.In (Vector.hd (Vector.tl v)) v.
proof: Proof. apply (Vector.caseS' v). intros ? w. apply (Vector.caseS' w). constructor. constructor. Qed.
imports: Undecidability.FOL(Semantics.FiniteTarski.Full) Undecidability.FOL(Syntax.Facts Semantics.Tarski.FullFacts Syntax.BinSig) Undecidability.SeparationLogic(MSL) Undecidability.Shared(Dec) Undecidability.Synthetic.DecidabilityFacts List