fact: Definition hintikka' s (L: clause) := match s with | fImp s t^+ => (s^- \in L) || (t^+ \in L) | fImp s t^- => (s^+ \in L) && (t^- \in L) | ([p0;;p1]s, b) => ([p0][p1]s, b) \in L | [p0 + p1]s^+ => ([p0]s^+ \in L) && ([p1]s^+ \in L) | [p0 + p1]s^- => ([p0]s^- \in L) || ([p1]s^- \in L) | [p^*]s^+ => (s^+ \in L) && ([p][p^*]s^+ \in L) | [p^*]s^- => (s^- \in L) || ([p][p^*]s^- \in L) | [s??]t^+ => (s^- \in L) || (t^+ \in L) | [s??]t^- => (s^+ \in L) && (t^- \in L) | _ => true end.
imports: Relations Lia Setoid Morphisms mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype rewrite_inequality fset_tac)