proposition: Lemma ax_Con p q s : prv ([p;;q]s <--> [p][q]s).
proof: Proof. rule axEI. exact: axConE. exact: axCon. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)