proposition: Lemma R0 a : R a fset0 = fset0.
proof: Proof. by rewrite /R sep0 fimset0. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)