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