proposition: Lemma tref_R1 S C : C \in U -> coref F tref S -> ~~ suppS S C -> tref C.
proof: Proof. Proof using sfc_F. move => inU coS sSC. apply: tref_R0 => // D. rewrite inE => /andP[D1 D2]. apply: coS. rewrite inE D1 /=. apply: contraNN sSC => ?. by apply/hasP; exists D. Qed.
imports: Relations Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.Kstar(Kstar_def demo hilbert_ref gen_def)