MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  rspce Structured version   Visualization version   GIF version

Theorem rspce 3566
Description: Restricted existential specialization, using implicit substitution. (Contributed by NM, 26-May-1998.) (Revised by Mario Carneiro, 11-Oct-2016.)
Hypotheses
Ref Expression
rspc.1 Ⅎ𝑥𝜓
rspc.2 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
Assertion
Ref Expression
rspce ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑)
Distinct variable groups:   𝑥,𝐴   𝑥,𝐵
Allowed substitution hints:   𝜑(𝑥)   𝜓(𝑥)

Proof of Theorem rspce
StepHypRef Expression
1 nfcv 2923 . . . 4 Ⅎ𝑥𝐴
2 nfv 1947 . . . . 5 Ⅎ𝑥 𝐴 ∈ 𝐵
3 rspc.1 . . . . 5 Ⅎ𝑥𝜓
42, 3nfan 1932 . . . 4 Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓)
5 eleq1 2849 . . . . 5 (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
6 rspc.2 . . . . 5 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
75, 6anbi12d 644 . . . 4 (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
81, 4, 7spcegf 3547 . . 3 (𝐴 ∈ 𝐵 → ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
98anabsi5 682 . 2 ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
10 df-rex 3088 . 2 (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
119, 10sylibr 237 1 ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812  Ⅎwnf 1816   ∈ wcel 2145  ∃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-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-cleq 2753  df-clel 2836  df-nfc 2910  df-rex 3088
This theorem is used by:  reuop  6295  ac6c4  10552  infcvgaux1i  16019  iunmbl2  25871  gsumpart  33617  esumcvg  34711  ptrecube  38518  poimirlem24  38542  sdclem1  38657  uzwo4  46039  eliuniincex  46093  elrnmpt1sf  46173  iuneqfzuzlem  46315  uzublem  46409  uzub  46410  limsupubuzlem  46691  sge0gerp  47374  smflim  47756  reupr  48573
  Copyright terms: Public domain W3C validator