| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > cbvmptvOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of cbvmptv 5230 as of 17-Nov-2024. (Contributed by Mario Carneiro, 19-Feb-2013.) Add disjoint variable condition to avoid ax-13 2377. See cbvmptvg 5232 for a less restrictive version requiring more axioms. (Revised by GG, 17-Jan-2024.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| cbvmptvOLD.1 | ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) |
| Ref | Expression |
|---|---|
| cbvmptvOLD | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | nfcv 2899 | . 2 ⊢ Ⅎ𝑦𝐵 | |
| 2 | nfcv 2899 | . 2 ⊢ Ⅎ𝑥𝐶 | |
| 3 | cbvmptvOLD.1 | . 2 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶) | |
| 4 | 1, 2, 3 | cbvmpt 5228 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑦 ∈ 𝐴 ↦ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 = wceq 1540 ↦ cmpt 5206 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-nfc 2886 df-rab 3421 df-v 3466 df-dif 3934 df-un 3936 df-ss 3948 df-nul 4314 df-if 4506 df-sn 4607 df-pr 4609 df-op 4613 df-opab 5187 df-mpt 5207 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |