| 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 1550 | . 2 ⊢ (𝐴 = 𝐶 → ∀𝑥 𝐴 = 𝐶) | |
| 2 | mpteq12f 4131 | . 2 ⊢ ((∀𝑥 𝐴 = 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐷) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) | |
| 3 | 1, 2 | sylan 283 | 1 ⊢ ((𝐴 = 𝐶 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐷) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
| Colors of variables: wff set class |
| Syntax hints: → wi 4 ∧ wa 104 ∀wal 1371 = wceq 1373 ∀wral 2485 ↦ cmpt 4112 |
| 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 1471 ax-7 1472 ax-gen 1473 ax-ie1 1517 ax-ie2 1518 ax-8 1528 ax-11 1530 ax-4 1534 ax-17 1550 ax-i9 1554 ax-ial 1558 ax-i5r 1559 ax-ext 2188 |
| This theorem depends on definitions: df-bi 117 df-tru 1376 df-nf 1485 df-sb 1787 df-clab 2193 df-cleq 2199 df-clel 2202 df-ral 2490 df-opab 4113 df-mpt 4114 |
| This theorem is referenced by: mpteq1 4135 mpteqb 5682 fmptcof 5759 mapxpen 6959 prodeq2w 11937 |
| Copyright terms: Public domain | W3C validator |