Theorem r19.37 3266

Description: Restricted quantifier version of one direction of 19.37 2269. (The other direction does not hold when 𝐴 is empty.) (Contributed by FL, 13-May-2012.) (Revised by Mario Carneiro, 11-Dec-2016.)

Hypothesis

Ref	Expression
r19.37.1	⊢ Ⅎ𝑥𝜑

Assertion

Ref	Expression
r19.37	⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∃𝑥 ∈ 𝐴 𝜓))

Proof of Theorem r19.37

Step	Hyp	Ref	Expression
1		r19.35 3121	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓))
2		r19.37.1	. . . 4 ⊢ Ⅎ𝑥𝜑
3		ax-1 6	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝜑))
4	2, 3	ralrimi 3261	. . 3 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝜑)
5	4	imim1i 64	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓) → (𝜑 → ∃𝑥 ∈ 𝐴 𝜓))
6	1, 5	sylbi 220	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (𝜑 → ∃𝑥 ∈ 𝐴 𝜓))

This proof depends on syntax axioms:   → wi 4  Ⅎwnf 1816   ∈ wcel 2145  ∀wral 3077  ∃wrex 3087

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 2213

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

This theorem is used by:  ss2iundf  44644