Theorem r19.23 3264

Description: Restricted quantifier version of 19.23 2250. See r19.23v 3194 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 3263	. 2 ⊢ (Ⅎ𝑥𝜓 → (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 → 𝜓)))
3	1, 2	ax-mp 5	1 ⊢ (∀𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∃𝑥 ∈ 𝐴 𝜑 → 𝜓))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209  Ⅎwnf 1816  ∀wral 3081  ∃wrex 3091

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-12 2216

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-ral 3082  df-rex 3092

This theorem is used by:  rexlimi  3267  iunssf  5009  iunssfOLD  5010  ralxp3f  8139