proposition: Lemma axContra s t : mprv (s ---> (~~: s) ---> t).
proof: Proof. rewrite /Neg. rewrite -> (axBE t). by rule axC. Qed.
imports: mathcomp(all_ssreflect) CompDecModal.libs(edone base fset induced_sym) Setoid Morphisms Relation_Definitions