fact: Variable (X : Type) (R : X -> X -> Prop) (f : nat -> option X) (Hf : forall x, exists y n, f n = Some y /\ R y x).
imports: List Arith Lia Permutation Relations Bool Eqdep_dec Undecidability.Shared.Libs.DLW.Utils(utils_tac utils_nat)