proposition: Lemma rNorm p s t : prv (s ---> t) -> prv ([p]s ---> [p]t).
proof: Proof. move => H. rule axN. exact: rNec. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)