proposition: Lemma memCPAuxTlOK : forall m cp s, memCPAux (S m) cp s = true -> memCPAux m (tailCP cp) s = true.
proof: Proof. intros m cp s Hmemcp. apply memMemCPAuxOK. intros e HIn. apply memCPAuxOK with (S m) cp; try assumption. apply InCPOK. right; assumption. Qed.
imports: Recdef NArith Sorting GeoCoq.Tactics.Coinc.Permutations GeoCoq.Utils.general_tactics GeoCoq.Utils.sets