fact: Hypothesis equiv_lowers: forall x0 (g h: forall x: {y: A | R y x0}, P (proj1_sig x)), (forall x p p', g (exist (fun y: A => R y x0) x p) = h (exist (fun y => R y x0) x p')) -> f g = f h.
imports: Coq.Init.Wf Coq.Program.Utils