Theorem mpt2eq123 5584

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
mpt2eq123	⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))

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

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

Proof of Theorem mpt2eq123

Dummy variable 𝑧 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1461	. . . 4 ⊢ Ⅎ𝑥 𝐴 = 𝐷
2		nfra1 2397	. . . 4 ⊢ Ⅎ𝑥∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
3	1, 2	nfan 1497	. . 3 ⊢ Ⅎ𝑥(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
4		nfv 1461	. . . 4 ⊢ Ⅎ𝑦 𝐴 = 𝐷
5		nfcv 2219	. . . . 5 ⊢ Ⅎ𝑦𝐴
6		nfv 1461	. . . . . 6 ⊢ Ⅎ𝑦 𝐵 = 𝐸
7		nfra1 2397	. . . . . 6 ⊢ Ⅎ𝑦∀𝑦 ∈ 𝐵 𝐶 = 𝐹
8	6, 7	nfan 1497	. . . . 5 ⊢ Ⅎ𝑦(𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
9	5, 8	nfralxy 2402	. . . 4 ⊢ Ⅎ𝑦∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)
10	4, 9	nfan 1497	. . 3 ⊢ Ⅎ𝑦(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
11		nfv 1461	. . 3 ⊢ Ⅎ𝑧(𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹))
12		rsp 2411	. . . . . . 7 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)))
13		rsp 2411	. . . . . . . . . 10 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → 𝐶 = 𝐹))
14		eqeq2 2090	. . . . . . . . . 10 ⊢ (𝐶 = 𝐹 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹))
15	13, 14	syl6 33	. . . . . . . . 9 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → (𝑦 ∈ 𝐵 → (𝑧 = 𝐶 ↔ 𝑧 = 𝐹)))
16	15	pm5.32d 437	. . . . . . . 8 ⊢ (∀𝑦 ∈ 𝐵 𝐶 = 𝐹 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹)))
17		eleq2 2142	. . . . . . . . 9 ⊢ (𝐵 = 𝐸 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐸))
18	17	anbi1d 452	. . . . . . . 8 ⊢ (𝐵 = 𝐸 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐹) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
19	16, 18	sylan9bbr 450	. . . . . . 7 ⊢ ((𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
20	12, 19	syl6 33	. . . . . 6 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → (𝑥 ∈ 𝐴 → ((𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶) ↔ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
21	20	pm5.32d 437	. . . . 5 ⊢ (∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
22		eleq2 2142	. . . . . 6 ⊢ (𝐴 = 𝐷 → (𝑥 ∈ 𝐴 ↔ 𝑥 ∈ 𝐷))
23	22	anbi1d 452	. . . . 5 ⊢ (𝐴 = 𝐷 → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
24	21, 23	sylan9bbr 450	. . . 4 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → ((𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹))))
25		anass 393	. . . 4 ⊢ (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ (𝑥 ∈ 𝐴 ∧ (𝑦 ∈ 𝐵 ∧ 𝑧 = 𝐶)))
26		anass 393	. . . 4 ⊢ (((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹) ↔ (𝑥 ∈ 𝐷 ∧ (𝑦 ∈ 𝐸 ∧ 𝑧 = 𝐹)))
27	24, 25, 26	3bitr4g 221	. . 3 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶) ↔ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)))
28	3, 10, 11, 27	oprabbid 5578	. 2 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)} = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)})
29		df-mpt2 5537	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑧 = 𝐶)}
30		df-mpt2 5537	. 2 ⊢ (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹) = {⟨⟨𝑥, 𝑦⟩, 𝑧⟩ ∣ ((𝑥 ∈ 𝐷 ∧ 𝑦 ∈ 𝐸) ∧ 𝑧 = 𝐹)}
31	28, 29, 30	3eqtr4g 2138	1 ⊢ ((𝐴 = 𝐷 ∧ ∀𝑥 ∈ 𝐴 (𝐵 = 𝐸 ∧ ∀𝑦 ∈ 𝐵 𝐶 = 𝐹)) → (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑥 ∈ 𝐷, 𝑦 ∈ 𝐸 ↦ 𝐹))

Syntax hints:   → wi 4   ∧ wa 102   ↔ wb 103   = wceq 1284   ∈ wcel 1433  ∀wral 2348  {coprab 5533   ↦ cmpt2 5534

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-nfc 2208  df-ral 2353  df-oprab 5536  df-mpt2 5537

This theorem is referenced by:  mpt2eq12  5585