fact: Definition simple_check_point_term (g : graph2 -> term sym) (G : graph2) : term sym := let (i,o) := (input : G, output : G) in if (edge_set (@bag G IO i) != set0) || (edge_set (@bag G IO o) != set0) then g (bgraph IO i) · g (igraph i o) · g (bgraph IO o) else if [pick z in @cp G i o :\: IO] isn't Some z then 1 else g (igraph i z) · g(bgraph IO z) · g(igraph z o).
imports: Coq(RelationClasses Morphisms Setoid Lia) mathcomp(all_ssreflect) GraphTheory(edone finite_quotient preliminaries) GraphTheory(digraph sgraph minor checkpoint cp_minor) GraphTheory(setoid_bigop structures pttdom ptt) GraphTheory(mgraph mgraph2 skeleton bounded)