proposition: Lemma axAUcmp s t : prv (fAU s t <--> ~~: ER (~~: s) (~~: t)).
proof: Proof. rule axAI; rewrite -> dmER, axDNE, axDNE; 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)