proposition: Lemma well_founded_iterated_prod_relationA {n} : well_founded (@iterated_prod_relationA n).
proof: Proof. induction n as [|n IHn]; simpl. { constructor; intros ? []. } { apply well_founded_prod_relationA; try exact _; assumption. } Defined.
imports: Coq.Setoids.Setoid Coq.Program.Program Coq.Program.Wf Coq.Arith.Wf_nat Coq.Classes.Morphisms Coq.Init.Wf Coq.Lists.SetoidList Coq.Arith.PeanoNat Fiat.Common.Coq__8_4__8_5__Compat