Theorem wl-dfrexfi 34883

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

Hypothesis

Ref	Expression
wl-drexfi.1	⊢ Ⅎ𝑥𝐴

Assertion

Ref	Expression
wl-dfrexfi	⊢ (∃(𝑥 : 𝐴)𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))

Proof of Theorem wl-dfrexfi

Step	Hyp	Ref	Expression
1		wl-drexfi.1	. 2 ⊢ Ⅎ𝑥𝐴
2		wl-dfrexf 34882	. 2 ⊢ (Ⅎ𝑥𝐴 → (∃(𝑥 : 𝐴)𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)))
3	1, 2	ax-mp 5	1 ⊢ (∃(𝑥 : 𝐴)𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐴 ∧ 𝜑))

Syntax hints:   ↔ wb 208   ∧ wa 398  ∃wex 1779   ∈ wcel 2113  Ⅎwnfc 2960  ∃wl-rex 34867

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-11 2160  ax-12 2176

This theorem depends on definitions:  df-bi 209  df-an 399  df-ex 1780  df-nf 1784  df-clel 2892  df-nfc 2962  df-wl-ral 34871  df-wl-rex 34881

This theorem is referenced by: (None)