| 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 2377. See cbvmptv 5204 for a version with more disjoint variable conditions, but not requiring ax-13 2377. (Contributed by Mario Carneiro, 19-Feb-2013.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cbvmptvg.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvmptvg | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2899 | . 2 ⊢ Ⅎ𝑦𝐵 | |
| 2 | nfcv 2899 | . 2 ⊢ Ⅎ𝑥𝐶 | |
| 3 | cbvmptvg.1 | . 2 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 4 | 1, 2, 3 | cbvmptg 5203 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1542 ↦ cmpt 5181 |
| 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-10 2147 ax-11 2163 ax-12 2185 ax-13 2377 ax-ext 2709 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-rab 3402 df-v 3444 df-dif 3906 df-un 3908 df-ss 3920 df-nul 4288 df-if 4482 df-sn 4583 df-pr 4585 df-op 4589 df-opab 5163 df-mpt 5182 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |