proposition: Lemma interp_CPTlOK {m : nat} : forall (cp : cartesianPower positive (S (S m))) interp, interp_CP (tailCP cp) interp = tailCP (interp_CP cp interp).
proof: Proof. induction m; unfold interp_CP; unfold nat_rect; simpl; reflexivity. Qed.
imports: Recdef NArith Sorting GeoCoq.Tactics.Coinc.Permutations GeoCoq.Utils.general_tactics GeoCoq.Utils.sets