proposition: Fact segerberg_vs_inductive s : SEG.prv s <-> prv s.
proof: Proof. split. - elim; solve [by constructor| eauto using rMP,segerberg,axStar]. - elim; try solve [by constructor| eauto using SEG.rMP]. move => p u _ /SEG.rNec IH. apply: SEG.rMP (IH (p^*)). by constructor. Qed.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)