Theorem mpteq12i 3866

Description: An equality inference for the maps to notation. (Contributed by Scott Fenton, 27-Oct-2010.) (Revised by Mario Carneiro, 16-Dec-2013.)

Hypotheses

Ref	Expression
mpteq12i.1	⊢ 𝐴 = 𝐶
mpteq12i.2	⊢ 𝐵 = 𝐷

Assertion

Ref	Expression
mpteq12i	⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)

Proof of Theorem mpteq12i

Step	Hyp	Ref	Expression
1		mpteq12i.1	. . . 4 ⊢ 𝐴 = 𝐶
2	1	a1i 9	. . 3 ⊢ (⊤ → 𝐴 = 𝐶)
3		mpteq12i.2	. . . 4 ⊢ 𝐵 = 𝐷
4	3	a1i 9	. . 3 ⊢ (⊤ → 𝐵 = 𝐷)
5	2, 4	mpteq12dv 3860	. 2 ⊢ (⊤ → (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷))
6	5	trud 1293	1 ⊢ (𝑥 ∈ 𝐴 ↦ 𝐵) = (𝑥 ∈ 𝐶 ↦ 𝐷)

Syntax hints:   = wceq 1284  ⊤wtru 1285   ↦ cmpt 3839

This theorem was proved from axioms:  ax-1 5  ax-2 6  ax-mp 7  ax-ia1 104  ax-ia2 105  ax-ia3 106  ax-5 1376  ax-7 1377  ax-gen 1378  ax-ie1 1422  ax-ie2 1423  ax-8 1435  ax-11 1437  ax-4 1440  ax-17 1459  ax-i9 1463  ax-ial 1467  ax-i5r 1468  ax-ext 2063

This theorem depends on definitions:  df-bi 115  df-tru 1287  df-nf 1390  df-sb 1686  df-clab 2068  df-cleq 2074  df-clel 2077  df-ral 2353  df-opab 3840  df-mpt 3841

This theorem is referenced by:  offres  5782