Theorem r19.23 3160

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

Syntax hints:   → wi 4   ↔ wb 196  Ⅎwnf 1857  ∀wral 3050  ∃wrex 3051

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1871  ax-4 1886  ax-5 1988  ax-6 2054  ax-7 2090  ax-12 2196

This theorem depends on definitions:  df-bi 197  df-or 384  df-an 385  df-ex 1854  df-nf 1859  df-ral 3055  df-rex 3056

This theorem is referenced by:  rexlimi  3162  ss2iundf  38471  iunssf  39780