proposition: Lemma map_tl X Y n (f : X -> Y) (v : vec X (S n)) : Vector.tl (Vector.map f v) = Vector.map f (Vector.tl v).
proof: Proof. now apply (Vector.caseS' v). Qed.
imports: Undecidability.FOL.Syntax.Facts Undecidability.FOL.Syntax.Asimpl Undecidability.FOL.Semantics.Tarski.FullFacts Undecidability.FOL.Deduction.FullNDFacts Undecidability.FOL.Sets(binZF ZF) Undecidability.FOL.Reductions.PCPb_to_ZF Undecidability(Shared.ListAutomation) Morphisms