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