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 6421 with a disjoint variable condition, which requires fewer axioms . (Contributed by Andrew Salmon, 1-Aug-2011.) (Revised by Gino Giotto, 30-Sep-2024.) |
Ref | Expression |
---|---|
cbviotavw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbviotavw | ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cbviotavw.1 | . . . . . 6 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
2 | 1 | cbvabv 2809 | . . . . 5 ⊢ {𝑥 ∣ 𝜑} = {𝑦 ∣ 𝜓} |
3 | 2 | eqeq1i 2741 | . . . 4 ⊢ ({𝑥 ∣ 𝜑} = {𝑧} ↔ {𝑦 ∣ 𝜓} = {𝑧}) |
4 | 3 | abbii 2806 | . . 3 ⊢ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
5 | 4 | unieqi 4857 | . 2 ⊢ ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} |
6 | df-iota 6410 | . 2 ⊢ (℩𝑥𝜑) = ∪ {𝑧 ∣ {𝑥 ∣ 𝜑} = {𝑧}} | |
7 | df-iota 6410 | . 2 ⊢ (℩𝑦𝜓) = ∪ {𝑧 ∣ {𝑦 ∣ 𝜓} = {𝑧}} | |
8 | 5, 6, 7 | 3eqtr4i 2774 | 1 ⊢ (℩𝑥𝜑) = (℩𝑦𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 {cab 2713 {csn 4565 ∪ cuni 4844 ℩cio 6408 |
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 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 398 df-tru 1542 df-ex 1780 df-sb 2066 df-clab 2714 df-cleq 2728 df-clel 2814 df-v 3439 df-in 3899 df-ss 3909 df-uni 4845 df-iota 6410 |
This theorem is referenced by: cbvriotavw 7274 oeeui 8464 nosupcbv 33954 noinfcbv 33969 ellimciota 43384 fourierdlem96 43972 fourierdlem97 43973 fourierdlem98 43974 fourierdlem99 43975 fourierdlem105 43981 fourierdlem106 43982 fourierdlem108 43984 fourierdlem110 43986 fourierdlem112 43988 fourierdlem113 43989 fourierdlem115 43991 funressndmafv2rn 44959 |
Copyright terms: Public domain | W3C validator |