fact: Definition gfp_continuous := forall (s : nat -> M -> M -> Prop), (forall n m, n <= m -> s m ⊆ s n) -> (fun x y => forall n, F (s n) x y) ⊆ F (fun x y => forall n, s n x y).
imports: List Arith Nat Lia Relations Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_list finite php) Undecidability.FOL.TRAKHTENBROT(notations)