proposition: Lemma circPermNId {T:Type} {n:nat} : forall (cp : cartesianPower T (S (S n))), cp = circPermNCP (S (S n)) cp.
proof: Proof. intro cp. apply circPermNIdAux. exact (headCP cp). Qed.
imports: Arith NArith List Sorting Coq.Program.Equality