Theorem mpteq12df 5197

Description: An equality inference for the maps-to notation. Compare mpteq12dv 5200. (Contributed by Scott Fenton, 8-Aug-2013.) (Revised by Mario Carneiro, 11-Dec-2016.) (Proof shortened by SN, 11-Nov-2024.)

Hypotheses

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

Assertion

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

Proof of Theorem mpteq12df

Step	Hyp	Ref	Expression
1		mpteq12df.1	. 2 ⊢ Ⅎ𝑥𝜑
2		mpteq12df.2	. 2 ⊢ (𝜑 → 𝐴 = 𝐶)
3		mpteq12df.3	. . 3 ⊢ (𝜑 → 𝐵 = 𝐷)
4	3	adantr 486	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐴) → 𝐵 = 𝐷)
5	1, 2, 4	mpteq12da 5196	1 ⊢ (𝜑 → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  Ⅎwnf 1816   ∈ wcel 2146   ↦ cmpt 5194

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-opab 5176  df-mpt 5195

This theorem is used by:  esumrnmpt2  34524  exrecfnlem  38084  mpteq1df  46011  smflimmpt  47584