Notation LexProd := (slexprod A B leA leB).

(* Specifications: *)
Lemma acc_A_B_lexprod : forall x : A, Acc leA x -> (forall x0 : A, clos_trans A leA x0 x -> well_founded (leB x0)) -> forall y : B x, Acc (leB x) y -> Acc LexProd (x; y).
Theorem wf_lexprod : well_founded leA -> (forall x : A, well_founded (leB x)) -> well_founded LexProd.
Theorem wf_slexprod : well_founded leA -> well_founded leB -> well_founded LexProd.