| 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 7338 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 2819 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝐴 ↔ 𝑦 ∈ 𝐴)) | |
| 2 | cbvriotavw.1 | . . . 4 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
| 3 | 1, 2 | anbi12d 633 | . . 3 ⊢ (𝑥 = 𝑦 → ((𝑥 ∈ 𝐴 ∧ 𝜑) ↔ (𝑦 ∈ 𝐴 ∧ 𝜓))) |
| 4 | 3 | cbviotavw 6462 | . 2 ⊢ (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) |
| 5 | df-riota 7324 | . 2 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑥(𝑥 ∈ 𝐴 ∧ 𝜑)) | |
| 6 | df-riota 7324 | . 2 ⊢ (℩𝑦 ∈ 𝐴 𝜓) = (℩𝑦(𝑦 ∈ 𝐴 ∧ 𝜓)) | |
| 7 | 4, 5, 6 | 3eqtr4i 2769 | 1 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ℩cio 6452 ℩crio 7323 |
| 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 df-riota 7324 |
| This theorem is referenced by: ordtypecbv 9432 fin23lem27 10250 zorn2g 10425 nosupcbv 27666 noinfcbv 27681 uspgredg2v 29293 usgredg2v 29296 cnlnadji 32147 nmopadjlei 32159 cvmliftlem15 35480 cvmliftiota 35483 cvmlift2 35498 cvmlift3lem7 35507 cvmlift3 35510 weiunlem 36645 lshpkrlem3 39558 cdleme40v 40915 lcfl7N 41947 lcf1o 41997 lcfrlem39 42027 hdmap1cbv 42248 wessf1ornlem 45615 fourierdlem103 46637 fourierdlem104 46638 |
| Copyright terms: Public domain | W3C validator |