proposition: Lemma fulfillAG_fun_mono s : monotone (fulfillAG_fun s).
proof: Proof. move => X Y /subP XsubY. apply: sep_sub (subxx _) _ => C inS. case: ([all _ in _ , _]) => //=. case: (suppS _ _ ) => //=. apply: sub_has => D. case: (_ C D) => //=. exact: XsubY. 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)