proposition: Lemma ax_cnfI s : prv (s ---> cnf s).
proof: Proof. rewrite -> ax_cnf. exact: axI. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)