proposition: Lemma R2 C s : ref (s^- |` R C) -> ref (fAX s^- |` C).
proof: Proof. rewrite /ref. do 2 rewrite -> andU,bigA1. rewrite -[_ (s^-)]/(~~: s) -[_ (fAX s^-)]/(~~: AX s) => H. rewrite -> dmAX,box_request. rewrite /=. rewrite <- axDF. rewrite <- H. rule axAcase. apply axDBD. Qed.
imports: Relations Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def demo)