proposition: Lemma cflip_eomerge_proof m (c1 c2 : connector m) : [forall i, cflip_eomerge c1 c2 (clink_eomerge c1 c2 i) == cflip_eomerge c1 c2 i].
proof: Proof. apply/forallP=> i /=. rewrite !ffunE /=; have [iO|iE] := boolP (odd i). by rewrite oliftK val_olift /= odd_double /= (eqP (forallP (cflipinv c2) _)). by rewrite eliftK val_elift /= odd_double /= (eqP (forallP (cflipinv c1) _)). Qed.
imports: mathcomp(all_ssreflect perm algebra.zmodp) mathcomp(zify) more_tuple