Metamath Proof Explorer


Theorem wl-dfrexfi

Description: Restricted universal quantification ( df-wl-rex ) allows a simplification, if we can assume all occurrences of x in A are bounded. (Contributed by Wolf Lammen, 26-May-2023)

Ref Expression
Hypothesis wl-drexfi.1 _ x A
Assertion wl-dfrexfi x : A φ x x A φ

Proof

Step Hyp Ref Expression
1 wl-drexfi.1 _ x A
2 wl-dfrexf _ x A x : A φ x x A φ
3 1 2 ax-mp x : A φ x x A φ