Definition lex_pair {A B} (Ra: A -> A -> Prop) (Rb: B -> B -> Prop)
            (x: A*B) (y: A*B) : Prop :=
 Ra (fst x) (fst y) \/ (fst x = fst y /\ Rb (snd x) (snd y)).

Lemma well_founded_incl: forall A (Rs Rt: A -> A -> Prop), inclusion _ Rt Rs -> well_founded Rs -> well_founded Rt.