proposition: Lemma consHeadCPTl {T:Type} {n:nat} : forall (cp : cartesianPower T (S n)) t, tailCP (consHeadCP t cp) = cp.
proof: Proof. intro cp; induction n; simpl; reflexivity. Qed.
imports: Arith NArith List Sorting Coq.Program.Equality