fact: Definition G I : set Te := fun t => SN R_aeq t /\ forall f, output_base (typ f) = a -> forall ts : Tes (arity (typ f)), R_aeq* t (apps (Fun f) ts) -> forall i (hi : Acc f i), int I (Vnth (inputs (typ f)) (Acc_arity hi)) (Vnth ts (Acc_arity hi)).
imports: Coq(IndefiniteDescription Structures.OrderedType) CoLoR(LogicUtil SN LCompSimple Tarski VecUtil SetUtil RelUtil)