proposition: Lemma size_iter3_aux k p q (s : seq A) : 0 < p -> size (iter3_aux k p q s) = size s.
proof: Proof. by move=> p_gt; apply/perm_size/perm_iter3_aux. Qed.
imports: mathcomp(all_ssreflect perm algebra.zmodp) mathcomp(zify) more_tuple nsort