proposition: Lemma size_flipcl F : size (flipcl F) <= 2 * size F.
proof: Proof. rewrite /flipcl. elim (elements F) => [|s xs IH] /=. - rewrite big_nil sizes0. done. - rewrite big_cons. apply: leq_trans; first exact: fsizeU. rewrite mulnS. apply: leq_add; last exact: IH. apply: leq_trans; first exact: fsizeU1. by rewrite fset1Es. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)