proposition: Lemma href_R1 C : C \in U -> ~~ suppS S C -> href C.
proof: Proof. Proof using coref_S sfc_F. rewrite /href => H1 H2. rewrite -> baseP => //. apply: bigOE => D. rewrite inE => /andP [D1 D2]. case:notF. apply: contraNT H2 => _. by apply/hasP; exists D. Qed.
imports: Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base modular_hilbert sltype) CompDecModal.K(K_def demo)