proposition: Lemma soundness_classical (M:ts) : (forall s, prv s -> forall (w : M), eval s w) -> stable (@eval M).
proof: Proof. move => H s w. exact: (H _ (axDN s)). Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)