proposition: Lemma axAUI s t : prv (t ---> fAU s t).
proof: Proof. rewrite -> axAUcmp. rewrite -> (axDNI t) at 1. rule ax_contraNN. rewrite -> axERf. exact: axAEl. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert) CompDecModal.CTL(CTL_def hilbert hilbert_hist)