proposition: Lemma axReg s t : prv (AR Bot (s ---> t) ---> EX s ---> EX t).
proof: Proof. do 2 rewrite -> axAReq. do 2 rewrite -> axOF. rule axAcase; drop. rewrite -> axAC,<- axABBA. rule axAcase; drop. rule axC. exact: axEXAXI. Qed.
imports: mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert) CompDecModal.CTL(CTL_def hilbert)