| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rspcedv | Structured version Visualization version GIF version | ||
| Description: Restricted existential specialization, using implicit substitution. (Contributed by FL, 17-Apr-2007.) (Revised by Mario Carneiro, 4-Jan-2017.) |
| Ref | Expression |
|---|---|
| rspcdv.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐵) |
| rspcdv.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) |
| Ref | Expression |
|---|---|
| rspcedv | ⊢ (𝜑 → (𝜒 → ∃𝑥 ∈ 𝐵 𝜓)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspcdv.1 | . 2 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
| 2 | rspcdv.2 | . . 3 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) | |
| 3 | 2 | biimprd 251 | . 2 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜒 → 𝜓)) |
| 4 | 1, 3 | rspcimedv 3568 | 1 ⊢ (𝜑 → (𝜒 → ∃𝑥 ∈ 𝐵 𝜓)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ 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-ext 2733 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2740 df-cleq 2753 df-clel 2836 df-ral 3078 df-rex 3088 |
| This theorem is used by: rspcebdv 3571 rspcev 3577 rspcedvd 3579 0csh0 14937 gcdcllem1 16662 nn0gsumfz 20191 pmatcollpw3lem 23094 pmatcollpw3fi1lem2 23098 pm2mpfo 23125 f1otrg 29441 cusgrfilem2 30030 wwlksnredwwlkn 30477 wwlksnextprop 30494 clwwlknun 30696 cusconngr 30785 xrofsup 33352 esum2d 34718 rexzrexnn0 43790 onsucelab 44249 ordnexbtwnsuc 44253 ov2ssiunov2 44685 requad2 48690 lcoel0 49509 lcoss 49517 el0ldep 49547 ldepspr 49554 islindeps2 49564 isldepslvec2 49566 affinecomb1 49783 isisod 50104 |
| Copyright terms: Public domain | W3C validator |