Section orbit_in.
Variable S : pred_sort (predPredType T).
Hypothesis f_in : {in S, forall x, f x \in S}.
Hypothesis injf : {in S &, injective f}.

Lemma fpath_finv_in p x : (x \in S) && (fpath finv x p) =
(last x p \in S) && (fpath f (last x p) (rev (belast x p))).