Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cbvriotav | Structured version Visualization version GIF version |
Description: Change bound variable in a restricted description binder. Usage of this theorem is discouraged because it depends on ax-13 2370. Use the weaker cbvriotavw 7303 when possible. (Contributed by NM, 18-Mar-2013.) (Revised by Mario Carneiro, 15-Oct-2016.) (New usage is discouraged.) |
Ref | Expression |
---|---|
cbvriotav.1 | ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) |
Ref | Expression |
---|---|
cbvriotav | ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | nfv 1916 | . 2 ⊢ Ⅎ𝑦𝜑 | |
2 | nfv 1916 | . 2 ⊢ Ⅎ𝑥𝜓 | |
3 | cbvriotav.1 | . 2 ⊢ (𝑥 = 𝑦 → (𝜑 ↔ 𝜓)) | |
4 | 1, 2, 3 | cbvriota 7307 | 1 ⊢ (℩𝑥 ∈ 𝐴 𝜑) = (℩𝑦 ∈ 𝐴 𝜓) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1540 ℩crio 7292 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-13 2370 ax-ext 2707 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-tru 1543 df-ex 1781 df-nf 1785 df-sb 2067 df-clab 2714 df-cleq 2728 df-clel 2814 df-v 3443 df-in 3905 df-ss 3915 df-sn 4574 df-uni 4853 df-iota 6431 df-riota 7293 |
This theorem is referenced by: (None) |
Copyright terms: Public domain | W3C validator |