| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rspce | Structured version Visualization version GIF version | ||
| Description: Restricted existential specialization, using implicit substitution. (Contributed by NM, 26-May-1998.) (Revised by Mario Carneiro, 11-Oct-2016.) |
| Ref | Expression |
|---|---|
| rspc.1 | ⊢ Ⅎ𝑥𝜓 |
| rspc.2 | ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| rspce | ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2899 | . . . 4 ⊢ Ⅎ𝑥𝐴 | |
| 2 | nfv 1916 | . . . . 5 ⊢ Ⅎ𝑥 𝐴 ∈ 𝐵 | |
| 3 | rspc.1 | . . . . 5 ⊢ Ⅎ𝑥𝜓 | |
| 4 | 2, 3 | nfan 1901 | . . . 4 ⊢ Ⅎ𝑥(𝐴 ∈ 𝐵 ∧ 𝜓) |
| 5 | eleq1 2825 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝑥 ∈ 𝐵 ↔ 𝐴 ∈ 𝐵)) | |
| 6 | rspc.2 | . . . . 5 ⊢ (𝑥 = 𝐴 → (𝜑 ↔ 𝜓)) | |
| 7 | 5, 6 | anbi12d 633 | . . . 4 ⊢ (𝑥 = 𝐴 → ((𝑥 ∈ 𝐵 ∧ 𝜑) ↔ (𝐴 ∈ 𝐵 ∧ 𝜓))) |
| 8 | 1, 4, 7 | spcegf 3535 | . . 3 ⊢ (𝐴 ∈ 𝐵 → ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑))) |
| 9 | 8 | anabsi5 670 | . 2 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) |
| 10 | df-rex 3063 | . 2 ⊢ (∃𝑥 ∈ 𝐵 𝜑 ↔ ∃𝑥(𝑥 ∈ 𝐵 ∧ 𝜑)) | |
| 11 | 9, 10 | sylibr 234 | 1 ⊢ ((𝐴 ∈ 𝐵 ∧ 𝜓) → ∃𝑥 ∈ 𝐵 𝜑) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∃wex 1781 Ⅎwnf 1785 ∈ wcel 2114 ∃wrex 3062 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-tru 1545 df-ex 1782 df-nf 1786 df-cleq 2729 df-clel 2812 df-nfc 2886 df-rex 3063 |
| This theorem is referenced by: reuop 6252 ac6c4 10397 infcvgaux1i 15816 iunmbl2 25537 gsumpart 33142 esumcvg 34249 ptrecube 37958 poimirlem24 37982 sdclem1 38081 uzwo4 45505 eliuniincex 45560 elrnmpt1sf 45640 iuneqfzuzlem 45785 uzublem 45879 uzub 45880 limsupubuzlem 46161 sge0gerp 46844 smflim 47226 reupr 47997 |
| Copyright terms: Public domain | W3C validator |