| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > sbelx | Structured version Visualization version GIF version | ||
| Description: Elimination of substitution. Also see sbel2x 2473. (Contributed by NM, 5-Aug-1993.) Avoid ax-13 2371. (Revised by Wolf Lammen, 6-Aug-2023.) Avoid ax-10 2142. (Revised by GG, 20-Aug-2023.) |
| Ref | Expression |
|---|---|
| sbelx | ⊢ (𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ [𝑥 / 𝑦]𝜑)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | sbequ12r 2253 | . . 3 ⊢ (𝑥 = 𝑦 → ([𝑥 / 𝑦]𝜑 ↔ 𝜑)) | |
| 2 | 1 | equsexvw 2005 | . 2 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ [𝑥 / 𝑦]𝜑) ↔ 𝜑) |
| 3 | 2 | bicomi 224 | 1 ⊢ (𝜑 ↔ ∃𝑥(𝑥 = 𝑦 ∧ [𝑥 / 𝑦]𝜑)) |
| Colors of variables: wff setvar class |
| Syntax hints: ↔ wb 206 ∧ wa 395 ∃wex 1779 [wsb 2065 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-12 2178 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-sb 2066 |
| This theorem is referenced by: pm13.196a 44375 |
| Copyright terms: Public domain | W3C validator |