![]() |
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 592 | . . . . . 6 ⊢ ((𝜑 ∧ 𝜓) → (𝜓 ↔ 𝜒)) |
4 | 3 | biimpd 228 | . . . . 5 ⊢ ((𝜑 ∧ 𝜓) → (𝜓 → 𝜒)) |
5 | 4 | expcom 415 | . . . 4 ⊢ (𝜓 → (𝜑 → (𝜓 → 𝜒))) |
6 | 5 | pm2.43b 55 | . . 3 ⊢ (𝜑 → (𝜓 → 𝜒)) |
7 | 6 | rexlimdvw 3154 | . 2 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 → 𝜒)) |
8 | rspcdv.1 | . . 3 ⊢ (𝜑 → 𝐴 ∈ 𝐵) | |
9 | 8, 2 | rspcedv 3576 | . 2 ⊢ (𝜑 → (𝜒 → ∃𝑥 ∈ 𝐵 𝜓)) |
10 | 7, 9 | impbid 211 | 1 ⊢ (𝜑 → (∃𝑥 ∈ 𝐵 𝜓 ↔ 𝜒)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 ∧ wa 397 = wceq 1542 ∈ wcel 2107 ∃wrex 3070 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2109 ax-9 2117 ax-ext 2704 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1545 df-ex 1783 df-sb 2069 df-clab 2711 df-cleq 2725 df-clel 2811 df-ral 3062 df-rex 3071 |
This theorem is referenced by: fusgr2wsp2nb 29327 |
Copyright terms: Public domain | W3C validator |