Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvmow | Structured version Visualization version GIF version |
Description: Rule used to change bound variables, using implicit substitution. Version of cbvmo 2689 with a disjoint variable condition, which does not require ax-13 2390. (Contributed by NM, 9-Mar-1995.) (Revised by Gino Giotto, 10-Jan-2024.) |
Ref | Expression |
---|---|
cbvmow.1 | ⊢ Ⅎ𝑦𝜑 |
cbvmow.2 | ⊢ Ⅎ𝑥𝜓 |
cbvmow.3 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvmow | ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbvmow.1 | . . . . 5 ⊢ Ⅎ𝑦𝜑 | |
2 | 1 | sb8ev 2374 | . . . 4 ⊢ (∃𝑥𝜑 ↔ ∃𝑦[𝑦 / 𝑥]𝜑) |
3 | 1 | sb8euv 2685 | . . . 4 ⊢ (∃!𝑥𝜑 ↔ ∃!𝑦[𝑦 / 𝑥]𝜑) |
4 | 2, 3 | imbi12i 353 | . . 3 ⊢ ((∃𝑥𝜑 → ∃!𝑥𝜑) ↔ (∃𝑦[𝑦 / 𝑥]𝜑 → ∃!𝑦[𝑦 / 𝑥]𝜑)) |
5 | moeu 2668 | . . 3 ⊢ (∃*𝑥𝜑 ↔ (∃𝑥𝜑 → ∃!𝑥𝜑)) | |
6 | moeu 2668 | . . 3 ⊢ (∃*𝑦[𝑦 / 𝑥]𝜑 ↔ (∃𝑦[𝑦 / 𝑥]𝜑 → ∃!𝑦[𝑦 / 𝑥]𝜑)) | |
7 | 4, 5, 6 | 3bitr4i 305 | . 2 ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦[𝑦 / 𝑥]𝜑) |
8 | cbvmow.2 | . . . 4 ⊢ Ⅎ𝑥𝜓 | |
9 | cbvmow.3 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
10 | 8, 9 | sbiev 2330 | . . 3 ⊢ ([𝑦 / 𝑥]𝜑 ↔ 𝜓) |
11 | 10 | mobii 2631 | . 2 ⊢ (∃*𝑦[𝑦 / 𝑥]𝜑 ↔ ∃*𝑦𝜓) |
12 | 7, 11 | bitri 277 | 1 ⊢ (∃*𝑥𝜑 ↔ ∃*𝑦𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∃wex 1780 Ⅎwnf 1784 [wsb 2069 ∃*wmo 2620 ∃!weu 2653 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-10 2145 ax-11 2161 ax-12 2177 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 |
This theorem is referenced by: dffun6f 6369 opabiotafun 6744 2ndcdisj 22064 cbvdisjf 30321 phpreu 34891 |
Copyright terms: Public domain | W3C validator |