Theorem r19.35 3295

Description: Restricted quantifier version of 19.35 1878. (Contributed by NM, 20-Sep-2003.)

Assertion

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

Proof of Theorem r19.35

Step	Hyp	Ref	Expression
1		pm2.27 42	. . . . 5 ⊢ (𝜑 → ((𝜑 → 𝜓) → 𝜓))
2	1	ralimi 3128	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → ∀𝑥 ∈ 𝐴 ((𝜑 → 𝜓) → 𝜓))
3		rexim 3204	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 ((𝜑 → 𝜓) → 𝜓) → (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → ∃𝑥 ∈ 𝐴 𝜓))
4	2, 3	syl 17	. . 3 ⊢ (∀𝑥 ∈ 𝐴 𝜑 → (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → ∃𝑥 ∈ 𝐴 𝜓))
5	4	com12 32	. 2 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) → (∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓))
6		rexnal 3201	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 ↔ ¬ ∀𝑥 ∈ 𝐴 𝜑)
7		pm2.21 123	. . . . 5 ⊢ (¬ 𝜑 → (𝜑 → 𝜓))
8	7	reximi 3206	. . . 4 ⊢ (∃𝑥 ∈ 𝐴 ¬ 𝜑 → ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓))
9	6, 8	sylbir 238	. . 3 ⊢ (¬ ∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓))
10		ax-1 6	. . . 4 ⊢ (𝜓 → (𝜑 → 𝜓))
11	10	reximi 3206	. . 3 ⊢ (∃𝑥 ∈ 𝐴 𝜓 → ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓))
12	9, 11	ja 189	. 2 ⊢ ((∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓) → ∃𝑥 ∈ 𝐴 (𝜑 → 𝜓))
13	5, 12	impbii 212	1 ⊢ (∃𝑥 ∈ 𝐴 (𝜑 → 𝜓) ↔ (∀𝑥 ∈ 𝐴 𝜑 → ∃𝑥 ∈ 𝐴 𝜓))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 209  ∀wral 3106  ∃wrex 3107

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

This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-ral 3111  df-rex 3112

This theorem is referenced by:  r19.36v  3296  r19.37  3297  r19.37v  3298  r19.43  3304  r19.37zv  4405  r19.36zv  4410  iinexg  5208  bndndx  11884  nmobndseqi  28562  nmobndseqiALT  28563  r19.36vf  41772