| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvmptvg | Structured version Visualization version GIF version | ||
| Description: Rule to change the bound variable in a maps-to function, using implicit substitution. Usage of this theorem is discouraged because it depends on ax-13 2380. See cbvmptv 5183 for a version with more disjoint variable conditions, but not requiring ax-13 2380. (Contributed by Mario Carneiro, 19-Feb-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cbvmptvg.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvmptvg | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2902 | . 2 ⊢ Ⅎ𝑦𝐵 | |
| 2 | nfcv 2902 | . 2 ⊢ Ⅎ𝑥𝐶 | |
| 3 | cbvmptvg.1 | . 2 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 4 | 1, 2, 3 | cbvmptg 5182 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1547 ↦ cmpt 5160 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-13 2380 ax-ext 2712 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-clab 2719 df-cleq 2732 df-clel 2815 df-nfc 2889 df-rab 3393 df-v 3434 df-dif 3893 df-un 3895 df-ss 3907 df-nul 4269 df-if 4462 df-sn 4563 df-pr 4565 df-op 4569 df-opab 5142 df-mpt 5161 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |