proposition: Lemma dmAX p s : prv (~~:[p]s <--> EX p (~~:s)).
proof: Proof. rewrite /EX. rewrite -> axDNE. exact: ax_eq_refl. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)