proposition: Lemma fin_modelP (M:fmodel) : stable (@eval M).
proof: Proof. move => s v. case: (decP (evalP v s)); tauto. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)