proposition: Lemma AXR_ind s t u : mprv (u ---> AX (t :/\: (s :\/: u))) -> mprv (u ---> AX (AR s t)).
proof: Proof. move => IH. rewrite -> IH. apply: rNorm. apply: rAR_ind. exact: axAEl. rewrite <- IH. rule axAcase. drop. exact: axI. Qed.
imports: mathcomp(all_ssreflect) CompDecModal.libs(edone base fset induced_sym) Setoid Morphisms Relation_Definitions