proposition: Lemma axABBA p s t : prv ([p]s :/\: [p]t ---> [p](s :/\: t)).
proof: Proof. rule axAcase. rewrite <- axN, <- axN. apply: rNec. exact: axAI. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)