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