proposition: Lemma fits_upath_strong_evalid: forall g p l e, fits_upath g l p -> In e l -> strong_evalid g e.
proof: Proof. induction p; destruct l; intros; try contradiction. destruct p eqn:Hp. unfold fits_upath in H. contradiction. rename l0 into p'. destruct l eqn:Hl. unfold fits_upath in H. simpl in H; destruct H. simpl in H0; destruct H0; try contradiction. rewrite H0 in H. destruct H. apply H. apply in_inv in H0. destruct H0. unfold fits_upath in H. simpl in H; destruct H. rewrite H0 in H. destruct H. apply H. apply fits_upath_cons in H. apply (IHp (e1::l0)). apply H. apply H0. Qed.
imports: Coq.Logic.Classical CertiGraph.lib.List_ext CertiGraph.lib.EquivDec_ext CertiGraph.graph.graph_model CertiGraph.graph.graph_relation CertiGraph.graph.path_lemmas CertiGraph.graph.graph_gen CertiGraph.graph.FiniteGraph