proposition: Lemma axDBD p s t : prv (EX p s ---> [p]t ---> EX p (s :/\: t)).
proof: Proof. do 3 Intro. Apply* 2. do 2 Rev. rewrite <- axN. apply: rNorm. do 3 Intro. Apply* 1. ApplyH axAI. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)