proposition: Lemma acc_A_B_lexprod : forall x:A, Acc leA x -> (well_founded leB) -> forall y:B, Acc leB y -> Acc lexprod (x, y).
proof: Proof. induction 1 as [x _ IHAcc]; intros H2 y. induction 1 as [x0 H IHAcc0]; intros. apply Acc_intro. destruct y as [x2 y1]; intro H6. simple inversion H6; intro. injection H1. injection H3. intros. subst. clear H1 H3. apply IHAcc; auto with sets. injection H1. intros; subst. injection H3. intros; subst. auto. Defined.
imports: Coq(Wf_nat Relations) Coq(Wellfounded Relation_Definitions) Coq(Relation_Operators Lexicographic_Product Wf_nat) Equations(Init Signature) Equations.CoreTactics Equations.Prop.Classes Equations.Prop.EqDec Equations.Prop.DepElim Equations.Prop.Constants