Theorem mpoeq123 7491

Description: An equality theorem for the maps-to notation. (Contributed by Mario Carneiro, 16-Dec-2013.) (Revised by Mario Carneiro, 19-Mar-2015.)

Assertion

Ref	Expression
mpoeq123	⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))

Distinct variable groups:   𝑥,𝑦,𝐴   𝑦,𝐵   𝑥,𝐷,𝑦   𝑦,𝐸

Allowed substitution hints:   𝐵(𝑥)   𝐶(𝑥, 𝑦)   𝐸(𝑥)   𝐹(𝑥, 𝑦)

Proof of Theorem mpoeq123

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . 4 ⊢ Ⅎ𝑥 𝐴 = 𝐷
2		nfra1 3291	. . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
3	1, 2	nfan 1932	. . 3 ⊢ Ⅎ𝑥(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
4		nfv 1947	. . . 4 ⊢ Ⅎ𝑦 𝐴 = 𝐷
5		nfcv 2927	. . . . 5 ⊢ Ⅎ𝑦𝐴
6		nfv 1947	. . . . . 6 ⊢ Ⅎ𝑦 𝐵 = 𝐸
7		nfra1 3291	. . . . . 6 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝐶 = 𝐹
8	6, 7	nfan 1932	. . . . 5 ⊢ Ⅎ𝑦(𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
9	5, 8	nfralw 3314	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
10	4, 9	nfan 1932	. . 3 ⊢ Ⅎ𝑦(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
11		nfv 1947	. . 3 ⊢ Ⅎ𝑧(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
12		rsp 3255	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)))
13		rsp 3255	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → 𝐶 = 𝐹))
14		eqeq2 2777	. . . . . . . . . 10 ⊢ (𝐶 = 𝐹 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹))
15	13, 14	syl6 36	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹)))
16	15	pm5.32d 588	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹)))
17		eleq2 2854	. . . . . . . . 9 ⊢ (𝐵 = 𝐸 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐸))
18	17	anbi1d 643	. . . . . . . 8 ⊢ (𝐵 = 𝐸 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
19	16, 18	sylan9bbr 520	. . . . . . 7 ⊢ ((𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
20	12, 19	syl6 36	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
21	20	pm5.32d 588	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
22		eleq2 2854	. . . . . 6 ⊢ (𝐴 = 𝐷 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐷))
23	22	anbi1d 643	. . . . 5 ⊢ (𝐴 = 𝐷 → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
24	21, 23	sylan9bbr 520	. . . 4 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
25		anass 474	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)))
26		anass 474	. . . 4 ⊢ (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
27	24, 25, 26	3bitr4g 317	. . 3 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)))
28	3, 10, 11, 27	oprabbid 7484	. 2 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)})
29		df-mpo 7424	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)}
30		df-mpo 7424	. 2 ⊢ (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)}
31	28, 29, 30	3eqtr4g 2825	1 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2146  ∀wral 3081  {coprab 7420   ∈ cmpo 7421

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-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-tru 1573  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ral 3082  df-oprab 7423  df-mpo 7424

This theorem is used by:  mpoeq12  7492  mapxpen  9138  pmatcollpw2lem  22986  xkoptsub  23864  xkocnv  24024  matunitlindflem1  38326