Intuitionistic Logic Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > ILE Home > Th. List > mpteq2da | GIF version |
Description: Slightly more general equality inference for the maps-to notation. (Contributed by FL, 14-Sep-2013.) (Revised by Mario Carneiro, 16-Dec-2013.) |
Ref | Expression |
---|---|
mpteq2da.1 | ⊢ Ⅎ𝑥𝜑 |
mpteq2da.2 | ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) |
Ref | Expression |
---|---|
mpteq2da | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | eqid 2165 | . . 3 ⊢ 𝐴 = 𝐴 | |
2 | 1 | ax-gen 1437 | . 2 ⊢ ∀𝑥 𝐴 = 𝐴 |
3 | mpteq2da.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
4 | mpteq2da.2 | . . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐶) | |
5 | 4 | ex 114 | . . 3 ⊢ (𝜑 → (𝑥 ∈ 𝐴 → 𝐵 = 𝐶)) |
6 | 3, 5 | ralrimi 2537 | . 2 ⊢ (𝜑 → ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) |
7 | mpteq12f 4062 | . 2 ⊢ ((∀𝑥 𝐴 = 𝐴 ∧ ∀𝑥 ∈ 𝐴 𝐵 = 𝐶) → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)) | |
8 | 2, 6, 7 | sylancr 411 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐴 ↦ 𝐶)) |
Colors of variables: wff set class |
Syntax hints: → wi 4 ∧ wa 103 ∀wal 1341 = wceq 1343 Ⅎwnf 1448 ∈ wcel 2136 ∀wral 2444 ↦ cmpt 4043 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-ia1 105 ax-ia2 106 ax-ia3 107 ax-5 1435 ax-7 1436 ax-gen 1437 ax-ie1 1481 ax-ie2 1482 ax-8 1492 ax-11 1494 ax-4 1498 ax-17 1514 ax-i9 1518 ax-ial 1522 ax-i5r 1523 ax-ext 2147 |
This theorem depends on definitions: df-bi 116 df-tru 1346 df-nf 1449 df-sb 1751 df-clab 2152 df-cleq 2158 df-clel 2161 df-ral 2449 df-opab 4044 df-mpt 4045 |
This theorem is referenced by: mpteq2dva 4072 prodeq1f 11493 prodeq2 11498 |
Copyright terms: Public domain | W3C validator |