| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > rspcebdv | Structured version Visualization version GIF version | ||
| Description: Restricted existential specialization, using implicit substitution in both directions. (Contributed by AV, 8-Jan-2022.) |
| Ref | Expression |
|---|---|
| rspcdv.1 | ⊢ (𝜑 → 𝐴 ∈ 𝐵) |
| rspcdv.2 | ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) |
| rspcebdv.1 | ⊢ ((𝜑 ∧ 𝜓) → 𝑥 = 𝐴) |
| Ref | Expression |
|---|---|
| rspcebdv | ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ 𝜒)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | rspcebdv.1 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝜓) → 𝑥 = 𝐴) | |
| 2 | rspcdv.2 | . . . . . . 7 ⊢ ((𝜑 ∧ 𝑥 = 𝐴) → (𝜓 ↔ 𝜒)) | |
| 3 | 1, 2 | syldan 603 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → (𝜓 ↔ 𝜒)) |
| 4 | 3 | biimpd 232 | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝜓 → 𝜒)) |
| 5 | 4 | expcom 419 | . . . 4 ⊢ (𝜓 → (𝜑 → (𝜓 → 𝜒))) |
| 6 | 5 | pm2.43b 56 | . . 3 ⊢ (𝜑 → (𝜓 → 𝜒)) |
| 7 | 6 | rexlimdvw 3173 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
| 8 | rspcdv.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
| 9 | 8, 2 | rspcedv 3576 | . 2 ⊢ (𝜑 → (𝜒 → ∃𝑥 ∈ 𝐵 𝜓)) |
| 10 | 7, 9 | impbid 215 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ 𝜒)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2146 ∃wrex 3091 |
| 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 2148 ax-9 2156 ax-ext 2737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-tru 1573 df-ex 1813 df-sb 2100 df-clab 2744 df-cleq 2757 df-clel 2840 df-ral 3082 df-rex 3092 |
| This theorem is used by: fusgr2wsp2nb 30758 |
| Copyright terms: Public domain | W3C validator |