proposition: Lemma axSer s : prv (fAX (~~: s) ---> ~~: fAX s).
proof: Proof. rewrite {2}/Neg. rewrite <- ax_serial. apply rAIL. rewrite -> axABBA. apply: rNorm. rule axAcase. exact: axI. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert) CompDecModal.CTL(CTL_def hilbert hilbert_hist)