| Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > ILE Home > Th. List > mpteq12 | GIF version | ||
| Description: An equality theorem for the maps-to notation. (Contributed by NM, 16-Dec-2013.) |
| Ref | Expression |
|---|---|
| mpteq12 | ⊢ ((𝐴 = 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐷) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ax-17 1575 | . 2 ⊢ (𝐴 = 𝐶 → ∀𝑥 𝐴 = 𝐶) | |
| 2 | mpteq12f 4189 | . 2 ⊢ ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐷) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) | |
| 3 | 1, 2 | sylan 283 | 1 ⊢ ((𝐴 = 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐷) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1396 = wceq 1398 ∀wral 2520 ↦ cmpt 4170 |
| 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 2214 |
| This theorem depends on definitions: df-bi 117 df-tru 1401 df-nf 1510 df-sb 1812 df-clab 2219 df-cleq 2225 df-clel 2228 df-ral 2525 df-opab 4171 df-mpt 4172 |
| This theorem is referenced by: mpteq1 4193 mpteqb 5767 fmptcof 5843 mapxpen 7100 prodeq2w 12238 |
| Copyright terms: Public domain | W3C validator |