proposition: Lemma axnEXF p : prv (~~: EX p Bot).
proof: Proof. rewrite /EX. rewrite -> axDNE. apply: rNec. exact: axI. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)