proposition: Lemma fset_iterF_sub i : iterF i `<=` U.
proof: Proof. by rewrite /= fset_iterFE fset_sub_val. Qed.
imports: HB(structures) mathcomp(ssreflect ssrbool ssrnat eqtype ssrfun seq) mathcomp(choice path finset finfun fintype bigop)