fact: Variable (P : nat -> Prop) (f : nat -> nat) (Hf : forall n, f n < f (S n)) (HP : forall n, P n <-> exists k, n = f k).
imports: List Arith Max Lia Wellfounded Bool Undecidability.Shared.Libs.DLW.Utils(list_focus utils_tac utils_list utils_nat)