Theorem rspcegf 45472

Description: A version of rspcev 3567 using bound-variable hypotheses instead of distinct variable conditions. (Contributed by Glauco Siliprandi, 20-Apr-2017.)

Hypotheses

Ref	Expression
rspcegf.1	⊢ Ⅎ𝑥𝜓
rspcegf.2	⊢ Ⅎ𝑥𝐴
rspcegf.3	⊢ Ⅎ𝑥𝐵
rspcegf.4	⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))

Assertion

Ref	Expression
rspcegf	⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑)

Proof of Theorem rspcegf

Step	Hyp	Ref	Expression
1		rspcegf.2	. . . 4 ⊢ Ⅎ𝑥𝐴
2		rspcegf.3	. . . . . 6 ⊢ Ⅎ𝑥𝐵
3	1, 2	nfel 2916	. . . . 5 ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵
4		rspcegf.1	. . . . 5 ⊢ Ⅎ𝑥𝜓
5	3, 4	nfan 1906	. . . 4 ⊢ Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓)
6		eleq1 2828	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
7		rspcegf.4	. . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
8	6, 7	anbi12d 638	. . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
9	1, 5, 8	spcegf 3537	. . 3 ⊢ (𝐴 ∈ 𝐵 → ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
10	9	anabsi5 675	. 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
11		df-rex 3065	. 2 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
12	10, 11	sylibr 235	1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑)

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   = wceq 1547  ∃wex 1786  Ⅎwnf 1790   ∈ wcel 2119  Ⅎwnfc 2887  ∃wrex 3064

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-tru 1550  df-ex 1787  df-nf 1791  df-cleq 2732  df-clel 2815  df-nfc 2889  df-rex 3065

This theorem is referenced by:  rspcef  45521  stoweidlem46  46490