proposition: Lemma I_eq_G' : forall a, I a [=] G' (I' a) (I a).
proof: Proof. intro a. rewrite I_eq_F at 1. unfold F. rewrite set_lfp_eq. 2: apply G'_mon. apply G'_ext. refl. rewrite I_eq_F. refl. Qed.
imports: Coq(IndefiniteDescription Structures.OrderedType) CoLoR(LogicUtil SN LCompSimple Tarski VecUtil SetUtil RelUtil)