Theorem mpteq12df 28837

Description: An equality theorem for the maps to notation. (Contributed by Thierry Arnoux, 30-May-2020.)

Hypotheses

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

Assertion

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

Proof of Theorem mpteq12df

Dummy variable 𝑦 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		mpteq12df.0	. . 3 ⊢ Ⅎ𝑥𝜑
2		nfv 1830	. . 3 ⊢ Ⅎ𝑦𝜑
3		mpteq12df.3	. . . . 5 ⊢ (𝜑 → 𝐴 = 𝐶)
4	3	eleq2d 2673	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐶))
5		mpteq12df.4	. . . . 5 ⊢ (𝜑 → 𝐵 = 𝐷)
6	5	eqeq2d 2620	. . . 4 ⊢ (𝜑 → (𝑦 = 𝐵 ↔ 𝑦 = 𝐷))
7	4, 6	anbi12d 743	. . 3 ⊢ (𝜑 → ((𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵) ↔ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)))
8	1, 2, 7	opabbid 4647	. 2 ⊢ (𝜑 → {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)} = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)})
9		df-mpt 4645	. 2 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐴 ∧ 𝑦 = 𝐵)}
10		df-mpt 4645	. 2 ⊢ (𝑥 ∈ 𝐶 ↦ 𝐷) = {⟨𝑥, 𝑦⟩ ∣ (𝑥 ∈ 𝐶 ∧ 𝑦 = 𝐷)}
11	8, 9, 10	3eqtr4g 2669	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷))

Syntax hints:   → wi 4   ∧ wa 383   = wceq 1475  Ⅎwnf 1699   ∈ wcel 1977  Ⅎwnfc 2738  {copab 4642   ↦ cmpt 4643

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590

This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-clab 2597  df-cleq 2603  df-clel 2606  df-opab 4644  df-mpt 4645

This theorem is referenced by:  esumrnmpt2  29457