proposition: Lemma ref_R1 C S : C \in U -> coref F ref' S -> ~~ suppS S C -> ref' C.
proof: Proof. move => inU coS sSC. apply: ref_R0 => // D. rewrite inE => /andP[D1 D2]. apply: coS. rewrite inE D1 /=. apply: contraNN sSC => ?. by apply/hasP; exists D. Qed.
imports: Lia mathcomp.ssreflect.ssreflect mathcomp(all_ssreflect) CompDecModal.libs(edone bcase fset base sltype) CompDecModal.CTL(CTL_def demo gen_def relaxed_pruning)