Theorem mpteq12dfOLD 5161

Description: Obsolete version of mpteq12df 5160 as of 11-Nov-2024. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 11-Dec-2016.) (Proof modification is discouraged.) (New usage is discouraged.)

Hypotheses

Ref	Expression
mpteq12df.1	⊢ Ⅎ𝑥𝜑
mpteq12df.2	⊢ (𝜑 → 𝐴 = 𝐶)
mpteq12df.3	⊢ (𝜑 → 𝐵 = 𝐷)

Assertion

Ref	Expression
mpteq12dfOLD	⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷))

Proof of Theorem mpteq12dfOLD

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mpteq12df.1	. . 3 ⊢ Ⅎ𝑥𝜑
2		nfv 1917	. . 3 ⊢ Ⅎ𝑦𝜑
3		mpteq12df.2	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐶)
4	3	eleq2d 2824	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶))
5		mpteq12df.3	. . . . 5 ⊢ (𝜑 → 𝐵 = 𝐷)
6	5	eqeq2d 2749	. . . 4 ⊢ (𝜑 → (𝑦 = 𝐵 ↔ 𝑦 = 𝐷))
7	4, 6	anbi12d 631	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)))
8	1, 2, 7	opabbid 5139	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)})
9		df-mpt 5158	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
10		df-mpt 5158	. 2 ⊢ (𝑥 ∈ 𝐶 ↦ 𝐷) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)}
11	8, 9, 10	3eqtr4g 2803	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷))

Syntax hints:   → wi 4   ∧ wa 396   = wceq 1539  Ⅎwnf 1786   ∈ wcel 2106  {copab 5136   ↦ cmpt 5157

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-12 2171  ax-ext 2709

This theorem depends on definitions:  df-bi 206  df-an 397  df-ex 1783  df-nf 1787  df-sb 2068  df-clab 2716  df-cleq 2730  df-clel 2816  df-opab 5137  df-mpt 5158

This theorem is referenced by: (None)