Theorem r19.23 3235

Description: Restricted quantifier version of 19.23 2219. See r19.23v 3165 for a version requiring fewer axioms. (Contributed by NM, 22-Oct-2010.) (Proof shortened by Mario Carneiro, 8-Oct-2016.)

Hypothesis

Ref	Expression
r19.23.1	⊢ Ⅎ𝑥𝜓

Assertion

Ref	Expression
r19.23	⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 → 𝜓))

Proof of Theorem r19.23

Step	Hyp	Ref	Expression
1		r19.23.1	. 2 ⊢ Ⅎ𝑥𝜓
2		r19.23t 3234	. 2 ⊢ (Ⅎ𝑥𝜓 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 → 𝜓)))
3	1, 2	ax-mp 5	1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 → 𝜓))

Syntax hints:   → wi 4   ↔ wb 206  Ⅎwnf 1785  ∀wral 3052  ∃wrex 3062

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-12 2185

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1782  df-nf 1786  df-ral 3053  df-rex 3063

This theorem is referenced by:  rexlimi  3238  iunssf  5000  iunssfOLD  5001  ralxp3f  8089