Section CGNoBadCycles.
Variable
no_bad_cycles :
forall (x : ad) (d : D) (l : list ad),
CG_path x d (x :: l) -> Dle Dz d = true.
(*s The edges are in the domain of the graph *)
(*s The length of a path without repetition is less than the cardinal of the map representing the graph *)

Lemma CG_path_weight_and_last_unique :
forall (l : list ad) (last last' : ad) (d d' : D),
CG_path last d l -> CG_path last' d' l -> d = d' /\ last = last'.