| 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 6464 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 2806 | . . . . 5 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} |
| 3 | 2 | eqeq1i 2741 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑦 ∣ 𝜓} = {𝑧}) |
| 4 | 3 | abbii 2803 | . . 3 ⊢ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
| 5 | 4 | unieqi 4862 | . 2 ⊢ ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
| 6 | df-iota 6454 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} | |
| 7 | df-iota 6454 | . 2 ⊢ (℩𝑦𝜓) = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} | |
| 8 | 5, 6, 7 | 3eqtr4i 2769 | 1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 = wceq 1542 {cab 2714 {csn 4567 ∪ cuni 4850 ℩cio 6452 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-tru 1545 df-ex 1782 df-sb 2069 df-clab 2715 df-cleq 2728 df-clel 2811 df-v 3431 df-ss 3906 df-uni 4851 df-iota 6454 |
| This theorem is referenced by: cbvriotavw 7334 oeeui 8538 nosupcbv 27666 noinfcbv 27681 cbvriotavw2 36418 ellimciota 46044 fourierdlem96 46630 fourierdlem97 46631 fourierdlem98 46632 fourierdlem99 46633 fourierdlem105 46639 fourierdlem106 46640 fourierdlem108 46642 fourierdlem110 46644 fourierdlem112 46646 fourierdlem113 46647 fourierdlem115 46649 funressndmafv2rn 47671 |
| Copyright terms: Public domain | W3C validator |