proposition: Lemma AR_ind s t u : prv (u ---> t) -> prv (u ---> (s ---> fF) ---> fAX u) -> prv (u ---> fAR s t).
proof: Proof. move => H1 H2. rewrite -> axARdef. rule axEUr. apply: rGen. ApplyH axAI => //. by rewrite -> axDNE. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert) CompDecModal.CTL(CTL_def hilbert)