| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mpteq1iOLD | Structured version Visualization version GIF version | ||
| Description: Obsolete version of mpteq1i 5216 as of 15-Nov-2024. (Contributed by Glauco Siliprandi, 17-Aug-2020.) (Proof modification is discouraged.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| mpteq1i.1 | ⊢ 𝐴 = 𝐵 |
| Ref | Expression |
|---|---|
| mpteq1iOLD | ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpteq1i.1 | . 2 ⊢ 𝐴 = 𝐵 | |
| 2 | mpteq1 5214 | . 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶)) | |
| 3 | 1, 2 | ax-mp 5 | 1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶) |
| Colors of variables: wff setvar class |
| Syntax hints: = 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-ext 2708 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-ex 1780 df-sb 2066 df-clab 2715 df-cleq 2728 df-clel 2810 df-opab 5187 df-mpt 5207 |
| This theorem is referenced by: (None) |
| Copyright terms: Public domain | W3C validator |