| 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 2406. See cbvmptv 5208 for a version with more disjoint variable conditions, but not requiring ax-13 2406. (Contributed by Mario Carneiro, 19-Feb-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cbvmptvg.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvmptvg | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2927 | . 2 ⊢ Ⅎ𝑦𝐵 | |
| 2 | nfcv 2927 | . 2 ⊢ Ⅎ𝑥𝐶 | |
| 3 | cbvmptvg.1 | . 2 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 4 | 1, 2, 3 | cbvmptg 5207 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1563 ↦ cmpt 5185 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1818 ax-4 1832 ax-5 1933 ax-6 1990 ax-7 2031 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2215 ax-13 2406 ax-ext 2737 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1566 df-fal 1576 df-ex 1803 df-nf 1807 df-sb 2094 df-clab 2744 df-cleq 2757 df-clel 2840 df-nfc 2914 df-rab 3418 df-v 3459 df-dif 3910 df-un 3912 df-ss 3924 df-nul 4289 df-if 4484 df-sn 4586 df-pr 4588 df-op 4592 df-opab 5167 df-mpt 5186 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |