Theorem cbvmpox 7510

Description: Rule to change the bound variable in a maps-to function, using implicit substitution. This version of cbvmpo 7511 allows 𝐵 to be a function of 𝑥. (Contributed by NM, 29-Dec-2014.)

Hypotheses

Ref	Expression
cbvmpox.1	⊢ Ⅎ𝑧𝐵
cbvmpox.2	⊢ Ⅎ𝑥𝐷
cbvmpox.3	⊢ Ⅎ𝑧𝐶
cbvmpox.4	⊢ Ⅎ𝑤𝐶
cbvmpox.5	⊢ Ⅎ𝑥𝐸
cbvmpox.6	⊢ Ⅎ𝑦𝐸
cbvmpox.7	⊢ (𝑥 = 𝑧 → 𝐵 = 𝐷)
cbvmpox.8	⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐶 = 𝐸)

Assertion

Ref	Expression
cbvmpox	⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ 𝐴, 𝑤 ∈ 𝐷 ↦ 𝐸)

Distinct variable groups:   𝑥,𝑤,𝑦,𝑧,𝐴   𝑤,𝐵   𝑦,𝐷

Allowed substitution hints:   𝐵(𝑥, 𝑦, 𝑧)   𝐶(𝑥, 𝑦, 𝑧, 𝑤)   𝐷(𝑥, 𝑧, 𝑤)   𝐸(𝑥, 𝑦, 𝑧, 𝑤)

Proof of Theorem cbvmpox

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴
2		cbvmpox.1	. . . . . 6 ⊢ Ⅎ𝑧𝐵
3	2	nfcri 2916	. . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵
4	1, 3	nfan 1932	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
5		cbvmpox.3	. . . . 5 ⊢ Ⅎ𝑧𝐶
6	5	nfeq2 2941	. . . 4 ⊢ Ⅎ𝑧 𝑢 = 𝐶
7	4, 6	nfan 1932	. . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)
8		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤 𝑥 ∈ 𝐴
9		nfcv 2924	. . . . . 6 ⊢ Ⅎ𝑤𝐵
10	9	nfcri 2916	. . . . 5 ⊢ Ⅎ𝑤 𝑦 ∈ 𝐵
11	8, 10	nfan 1932	. . . 4 ⊢ Ⅎ𝑤(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
12		cbvmpox.4	. . . . 5 ⊢ Ⅎ𝑤𝐶
13	12	nfeq2 2941	. . . 4 ⊢ Ⅎ𝑤 𝑢 = 𝐶
14	11, 13	nfan 1932	. . 3 ⊢ Ⅎ𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)
15		nfv 1947	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
16		cbvmpox.2	. . . . . 6 ⊢ Ⅎ𝑥𝐷
17	16	nfcri 2916	. . . . 5 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐷
18	15, 17	nfan 1932	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷)
19		cbvmpox.5	. . . . 5 ⊢ Ⅎ𝑥𝐸
20	19	nfeq2 2941	. . . 4 ⊢ Ⅎ𝑥 𝑢 = 𝐸
21	18, 20	nfan 1932	. . 3 ⊢ Ⅎ𝑥((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 = 𝐸)
22		nfv 1947	. . . 4 ⊢ Ⅎ𝑦(𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷)
23		cbvmpox.6	. . . . 5 ⊢ Ⅎ𝑦𝐸
24	23	nfeq2 2941	. . . 4 ⊢ Ⅎ𝑦 𝑢 = 𝐸
25	22, 24	nfan 1932	. . 3 ⊢ Ⅎ𝑦((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 = 𝐸)
26		eleq1w 2845	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
27	26	adantr 486	. . . . 5 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
28		cbvmpox.7	. . . . . . 7 ⊢ (𝑥 = 𝑧 → 𝐵 = 𝐷)
29	28	eleq2d 2848	. . . . . 6 ⊢ (𝑥 = 𝑧 → (𝑦 ∈ 𝐵 ↔ 𝑦 ∈ 𝐷))
30		eleq1w 2845	. . . . . 6 ⊢ (𝑦 = 𝑤 → (𝑦 ∈ 𝐷 ↔ 𝑤 ∈ 𝐷))
31	29, 30	sylan9bb 519	. . . . 5 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑦 ∈ 𝐵 ↔ 𝑤 ∈ 𝐷))
32	27, 31	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷)))
33		cbvmpox.8	. . . . 5 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → 𝐶 = 𝐸)
34	33	eqeq2d 2773	. . . 4 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (𝑢 = 𝐶 ↔ 𝑢 = 𝐸))
35	32, 34	anbi12d 644	. . 3 ⊢ ((𝑥 = 𝑧 ∧ 𝑦 = 𝑤) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶) ↔ ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 = 𝐸)))
36	7, 14, 21, 25, 35	cbvoprab12 7506	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)} = {⟨⟨𝑧, 𝑤⟩, 𝑢⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 = 𝐸)}
37		df-mpo 7422	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)}
38		df-mpo 7422	. 2 ⊢ (𝑧 ∈ 𝐴, 𝑤 ∈ 𝐷 ↦ 𝐸) = {⟨⟨𝑧, 𝑤⟩, 𝑢⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑤 ∈ 𝐷) ∧ 𝑢 = 𝐸)}
39	36, 37, 38	3eqtr4i 2795	1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ 𝐴, 𝑤 ∈ 𝐷 ↦ 𝐸)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570   ∈ wcel 2145  Ⅎwnfc 2909  {coprab 7418   ∈ cmpo 7419

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 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2734  ax-sep 5255  ax-pr 5402

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-rab 3415  df-v 3455  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-sn 4588  df-pr 4590  df-op 4594  df-opab 5172  df-oprab 7421  df-mpo 7422

This theorem is used by:  cbvmpo  7511  mpomptsx  8065  dmmpossx  8067  gsumcom2  20108  ptcmpg  24289