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 5153. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 11-Dec-2016.) |
Ref | Expression |
---|---|
mpteq12df.1 | ⊢ Ⅎ𝑥𝜑 |
mpteq12df.2 | ⊢ (𝜑 → 𝐴 = 𝐶) |
mpteq12df.3 | ⊢ (𝜑 → 𝐵 = 𝐷) |
Ref | Expression |
---|---|
mpteq12df | ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | mpteq12df.1 | . . 3 ⊢ Ⅎ𝑥𝜑 | |
2 | nfv 1915 | . . 3 ⊢ Ⅎ𝑦𝜑 | |
3 | mpteq12df.2 | . . . . 5 ⊢ (𝜑 → 𝐴 = 𝐶) | |
4 | 3 | eleq2d 2900 | . . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶)) |
5 | mpteq12df.3 | . . . . 5 ⊢ (𝜑 → 𝐵 = 𝐷) | |
6 | 5 | eqeq2d 2834 | . . . 4 ⊢ (𝜑 → (𝑦 = 𝐵 ↔ 𝑦 = 𝐷)) |
7 | 4, 6 | anbi12d 632 | . . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷))) |
8 | 1, 2, 7 | opabbid 5133 | . 2 ⊢ (𝜑 → {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)}) |
9 | df-mpt 5149 | . 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} | |
10 | df-mpt 5149 | . 2 ⊢ (𝑥 ∈ 𝐶 ↦ 𝐷) = {〈𝑥, 𝑦〉 ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)} | |
11 | 8, 9, 10 | 3eqtr4g 2883 | 1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 398 = wceq 1537 Ⅎwnf 1784 ∈ wcel 2114 {copab 5130 ↦ cmpt 5148 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-12 2177 ax-ext 2795 |
This theorem depends on definitions: df-bi 209 df-an 399 df-ex 1781 df-nf 1785 df-sb 2070 df-clab 2802 df-cleq 2816 df-clel 2895 df-opab 5131 df-mpt 5149 |
This theorem is referenced by: mpteq12dv 5153 esumrnmpt2 31329 exrecfnlem 34662 smflimmpt 43091 |
Copyright terms: Public domain | W3C validator |