| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvriotavw | Structured version Visualization version GIF version | ||
| Description: Change bound variable in a restricted description binder. Version of cbvriotav 7331 with a disjoint variable condition, which requires fewer axioms . (Contributed by NM, 18-Mar-2013.) (Revised by GG, 30-Sep-2024.) |
| Ref | Expression |
|---|---|
| cbvriotavw.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
| Ref | Expression |
|---|---|
| cbvriotavw | ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eleq1w 2824 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 2 | cbvriotavw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | anbi12d 639 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓))) |
| 4 | 3 | cbviotavw 6453 | . 2 ⊢ (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) |
| 5 | df-riota 7317 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 6 | df-riota 7317 | . 2 ⊢ (℩𝑦 ∈ 𝐴 𝜓) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) | |
| 7 | 4, 5, 6 | 3eqtr4i 2774 | 1 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 208 ∧ wa 397 = wceq 1548 ∈ wcel 2121 ℩cio 6443 ℩crio 7316 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1803 ax-4 1817 ax-5 1918 ax-6 1975 ax-7 2016 ax-8 2123 ax-9 2131 ax-ext 2713 |
| This theorem depends on definitions: df-bi 209 df-an 398 df-tru 1551 df-ex 1788 df-sb 2075 df-clab 2720 df-cleq 2733 df-clel 2816 df-v 3435 df-ss 3902 df-uni 4842 df-iota 6445 df-riota 7317 |
| This theorem is referenced by: ordtypecbv 9426 fin23lem27 10245 zorn2g 10420 nosupcbv 27688 noinfcbv 27703 uspgredg2v 29315 usgredg2v 29318 cnlnadji 32169 nmopadjlei 32181 cvmliftlem15 35541 cvmliftiota 35544 cvmlift2 35559 cvmlift3lem7 35568 cvmlift3 35571 weiunlem 36706 lshpkrlem3 39619 cdleme40v 40976 lcfl7N 42008 lcf1o 42058 lcfrlem39 42088 hdmap1cbv 42309 wessf1ornlem 45646 fourierdlem103 46666 fourierdlem104 46667 |
| Copyright terms: Public domain | W3C validator |