| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbviotavw | Structured version Visualization version GIF version | ||
| Description: Change bound variables in a description binder. Version of cbviotav 6487 with a disjoint variable condition, which requires fewer axioms . (Contributed by Andrew Salmon, 1-Aug-2011.) (Revised by GG, 30-Sep-2024.) |
| Ref | Expression |
|---|---|
| cbviotavw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbviotavw | ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cbviotavw.1 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 2 | 1 | cbvabv 2832 | . . . . 5 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} |
| 3 | 2 | eqeq1i 2767 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑦 ∣ 𝜓} = {𝑧}) |
| 4 | 3 | abbii 2829 | . . 3 ⊢ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
| 5 | 4 | unieqi 4877 | . 2 ⊢ ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
| 6 | df-iota 6477 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} | |
| 7 | df-iota 6477 | . 2 ⊢ (℩𝑦𝜓) = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} | |
| 8 | 5, 6, 7 | 3eqtr4i 2795 | 1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 = wceq 1560 {cab 2740 {csn 4582 ∪ cuni 4865 ℩cio 6475 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1815 ax-4 1829 ax-5 1930 ax-6 1987 ax-7 2028 ax-8 2144 ax-9 2152 ax-ext 2734 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-tru 1563 df-ex 1800 df-sb 2091 df-clab 2741 df-cleq 2754 df-clel 2837 df-v 3456 df-ss 3921 df-uni 4866 df-iota 6477 |
| This theorem is referenced by: cbvriotavw 7363 oeeui 8572 nosupcbv 27763 noinfcbv 27778 cbvriotavw2 36593 ellimciota 46187 fourierdlem96 46773 fourierdlem97 46774 fourierdlem98 46775 fourierdlem99 46776 fourierdlem105 46782 fourierdlem106 46783 fourierdlem108 46785 fourierdlem110 46787 fourierdlem112 46789 fourierdlem113 46790 fourierdlem115 46792 funressndmafv2rn 47814 |
| Copyright terms: Public domain | W3C validator |