proposition: Lemma R1 C : C \in U -> ~~ suppS S C -> ref C.
proof: Proof. Proof using coref_S sfc_F. rewrite /ref => H1 H2. rewrite -> baseP => //. apply: bigOE => D. rewrite inE => /andP [D1 D2]. case:notF. apply: contraNT H2 => _. 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)