proposition: Lemma fresh_eqF (E : {fset nat}) (x : E) : val x == fresh E = false.
proof: Proof. by rewrite fsval_eqF // freshP. Qed.
imports: HB(structures) Coq(Relation_Definitions Morphisms RelationClasses) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries bij equiv) GraphTheory(setoid_bigop structures pttdom rewriting) GraphTheory(finmap_plus)