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

Theorem rspce 3569
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 2926 . . . 4 Ⅎ𝑥𝐴
2 nfv 1949 . . . . 5 Ⅎ𝑥 𝐴 ∈ 𝐵
3 rspc.1 . . . . 5 Ⅎ𝑥𝜓
42, 3nfan 1934 . . . 4 Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓)
5 eleq1 2852 . . . . 5 (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵))
6 rspc.2 . . . . 5 (𝑥 = 𝐴 → (𝜑 ↔ 𝜓))
75, 6anbi12d 644 . . . 4 (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓)))
81, 4, 7spcegf 3550 . . 3 (𝐴 ∈ 𝐵 → ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)))
98anabsi5 682 . 2 ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))
10 df-rex 3091 . 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 2147  ∃wrex 3090
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735
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 2755  df-clel 2839  df-nfc 2913  df-rex 3091
This theorem is used by:  reuop  6322  ac6c4  10598  infcvgaux1i  16070  iunmbl2  25933  gsumpart  33723  esumcvg  34829  ptrecube  38806  poimirlem24  38830  sdclem1  38943  uzwo4  46344  eliuniincex  46397  elrnmpt1sf  46477  iuneqfzuzlem  46619  uzublem  46713  uzub  46714  limsupubuzlem  46995  sge0gerp  47678  smflim  48060  reupr  48877
  Copyright terms: Public domain W3C validator