| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpteq1d | GIF version | ||
| Description: An equality theorem for the maps-to notation. (Contributed by Mario Carneiro, 11-Jun-2016.) |
| Ref | Expression |
|---|---|
| mpteq1d.1 | ⊢ (𝜑 → 𝐴 = 𝐵) |
| Ref | Expression |
|---|---|
| mpteq1d | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mpteq1d.1 | . 2 ⊢ (𝜑 → 𝐴 = 𝐵) | |
| 2 | mpteq1 4178 | . 2 ⊢ (𝐴 = 𝐵 → (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶)) | |
| 3 | 1, 2 | syl 14 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐶) = (𝑥 ∈ 𝐵 ↦ 𝐶)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 = wceq 1398 ↦ cmpt 4155 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 106 ax-ia2 107 ax-ia3 108 ax-5 1496 ax-7 1497 ax-gen 1498 ax-ie1 1542 ax-ie2 1543 ax-8 1553 ax-11 1555 ax-4 1559 ax-17 1575 ax-i9 1579 ax-ial 1583 ax-i5r 1584 ax-ext 2213 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1811 df-clab 2218 df-cleq 2224 df-clel 2227 df-ral 2516 df-opab 4156 df-mpt 4157 |
| This theorem is referenced by: mptimass 5095 fmptapd 5853 offval 6252 swrd00g 11277 swrdlend 11286 swrd0g 11288 qusex 13469 mulgnn0gsum 13776 gsumfzconst 13989 gsumfzsnfd 13993 gsumfzfsumlem0 14662 gsumfzfsumlemm 14663 gsumgfsumlem 16792 gsumgfsum 16793 |
| Copyright terms: Public domain | W3C validator |