Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > mpteq12df | Structured version Visualization version GIF version |
Description: An equality inference for the maps-to notation. Compare mpteq12dv 5161. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 11-Dec-2016.) (Proof shortened by SN, 11-Nov-2024.) |
Ref | Expression |
---|---|
mpteq12df.1 | ⊢ Ⅎ𝑥𝜑 |
mpteq12df.2 | ⊢ (𝜑 → 𝐴 = 𝐶) |
mpteq12df.3 | ⊢ (𝜑 → 𝐵 = 𝐷) |
Ref | Expression |
---|---|
mpteq12df | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mpteq12df.1 | . 2 ⊢ Ⅎ𝑥𝜑 | |
2 | mpteq12df.2 | . 2 ⊢ (𝜑 → 𝐴 = 𝐶) | |
3 | mpteq12df.3 | . . 3 ⊢ (𝜑 → 𝐵 = 𝐷) | |
4 | 3 | adantr 480 | . 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐷) |
5 | 1, 2, 4 | mpteq12da 5155 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1539 Ⅎwnf 1787 ∈ wcel 2108 ↦ cmpt 5153 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-12 2173 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 396 df-ex 1784 df-nf 1788 df-sb 2069 df-clab 2716 df-cleq 2730 df-clel 2817 df-opab 5133 df-mpt 5154 |
This theorem is referenced by: esumrnmpt2 31936 exrecfnlem 35477 mpteq1df 42668 smflimmpt 44230 |
Copyright terms: Public domain | W3C validator |