Theorem r19.35-1 2620

Description: Restricted quantifier version of 19.35-1 1617. (Contributed by Jim Kingdon, 4-Jun-2018.)

Assertion

Ref	Expression
r19.35-1	⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓))

Proof of Theorem r19.35-1

Step	Hyp	Ref	Expression
1		r19.29 2607	. . 3 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓)) → ∃𝑥 ∈ 𝐴 (𝜑 ∧ (𝜑 → 𝜓)))
2		pm3.35 345	. . . 4 ⊢ ((𝜑 ∧ (𝜑 → 𝜓)) → 𝜓)
3	2	reximi 2567	. . 3 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 ∧ (𝜑 → 𝜓)) → ∃𝑥 ∈ 𝐴 𝜓)
4	1, 3	syl 14	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 ∧ ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓)) → ∃𝑥 ∈ 𝐴 𝜓)
5	4	expcom 115	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓))

Syntax hints:   → wi 4   ∧ wa 103  ∀wral 2448  ∃wrex 2449

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-5 1440  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-4 1503  ax-ial 1527

This theorem depends on definitions:  df-bi 116  df-ral 2453  df-rex 2454

This theorem is referenced by:  r19.36av  2621  r19.37  2622  iinexgm  4140  bndndx  9134