proposition: Lemma refI1n s C : prv ([af C] ---> s) -> ref (s^- |` C).
proof: Proof. move => H. rewrite /ref. rewrite -> andU,H,bigA1,axAC. rule axAcase. exact: axContra. Qed.
imports: Relations Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def demo)