Theorem cbvmpox2 49175

Description: Rule to change the bound variable in a maps-to function, using implicit substitution. This version of cbvmpo 7513 allows 𝐴 to be a function of 𝑦, analogous to cbvmpox 7512. (Contributed by AV, 30-Mar-2019.)

Hypotheses

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

Assertion

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

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

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

Proof of Theorem cbvmpox2

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤 𝑥 ∈ 𝐴
2		nfv 1947	. . . . 5 ⊢ Ⅎ𝑤 𝑦 ∈ 𝐵
3	1, 2	nfan 1932	. . . 4 ⊢ Ⅎ𝑤(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
4		cbvmpox2.4	. . . . 5 ⊢ Ⅎ𝑤𝐶
5	4	nfeq2 2944	. . . 4 ⊢ Ⅎ𝑤 𝑢 = 𝐶
6	3, 5	nfan 1932	. . 3 ⊢ Ⅎ𝑤((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)
7		cbvmpox2.1	. . . . . 6 ⊢ Ⅎ𝑧𝐴
8	7	nfcri 2919	. . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴
9		nfv 1947	. . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵
10	8, 9	nfan 1932	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
11		cbvmpox2.3	. . . . 5 ⊢ Ⅎ𝑧𝐶
12	11	nfeq2 2944	. . . 4 ⊢ Ⅎ𝑧 𝑢 = 𝐶
13	10, 12	nfan 1932	. . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)
14		nfv 1947	. . . . 5 ⊢ Ⅎ𝑥 𝑤 ∈ 𝐷
15		nfv 1947	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐵
16	14, 15	nfan 1932	. . . 4 ⊢ Ⅎ𝑥(𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵)
17		cbvmpox2.5	. . . . 5 ⊢ Ⅎ𝑥𝐸
18	17	nfeq2 2944	. . . 4 ⊢ Ⅎ𝑥 𝑢 = 𝐸
19	16, 18	nfan 1932	. . 3 ⊢ Ⅎ𝑥((𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵) ∧ 𝑢 = 𝐸)
20		cbvmpox2.2	. . . . . 6 ⊢ Ⅎ𝑦𝐷
21	20	nfcri 2919	. . . . 5 ⊢ Ⅎ𝑦 𝑤 ∈ 𝐷
22		nfv 1947	. . . . 5 ⊢ Ⅎ𝑦 𝑧 ∈ 𝐵
23	21, 22	nfan 1932	. . . 4 ⊢ Ⅎ𝑦(𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵)
24		cbvmpox2.6	. . . . 5 ⊢ Ⅎ𝑦𝐸
25	24	nfeq2 2944	. . . 4 ⊢ Ⅎ𝑦 𝑢 = 𝐸
26	23, 25	nfan 1932	. . 3 ⊢ Ⅎ𝑦((𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵) ∧ 𝑢 = 𝐸)
27		eleq1w 2848	. . . . . 6 ⊢ (𝑥 = 𝑤 → (𝑥 ∈ 𝐴 ↔ 𝑤 ∈ 𝐴))
28		cbvmpox2.7	. . . . . . 7 ⊢ (𝑦 = 𝑧 → 𝐴 = 𝐷)
29	28	eleq2d 2851	. . . . . 6 ⊢ (𝑦 = 𝑧 → (𝑤 ∈ 𝐴 ↔ 𝑤 ∈ 𝐷))
30	27, 29	sylan9bb 519	. . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → (𝑥 ∈ 𝐴 ↔ 𝑤 ∈ 𝐷))
31		simpr 490	. . . . . 6 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → 𝑦 = 𝑧)
32	31	eleq1d 2850	. . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → (𝑦 ∈ 𝐵 ↔ 𝑧 ∈ 𝐵))
33	30, 32	anbi12d 644	. . . 4 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵)))
34		cbvmpox2.8	. . . . . 6 ⊢ ((𝑦 = 𝑧 ∧ 𝑥 = 𝑤) → 𝐶 = 𝐸)
35	34	ancoms 464	. . . . 5 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → 𝐶 = 𝐸)
36	35	eqeq2d 2776	. . . 4 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → (𝑢 = 𝐶 ↔ 𝑢 = 𝐸))
37	33, 36	anbi12d 644	. . 3 ⊢ ((𝑥 = 𝑤 ∧ 𝑦 = 𝑧) → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶) ↔ ((𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵) ∧ 𝑢 = 𝐸)))
38	6, 13, 19, 26, 37	cbvoprab12 7508	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)} = {⟨⟨𝑤, 𝑧⟩, 𝑢⟩ ∣ ((𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵) ∧ 𝑢 = 𝐸)}
39		df-mpo 7424	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)}
40		df-mpo 7424	. 2 ⊢ (𝑤 ∈ 𝐷, 𝑧 ∈ 𝐵 ↦ 𝐸) = {⟨⟨𝑤, 𝑧⟩, 𝑢⟩ ∣ ((𝑤 ∈ 𝐷 ∧ 𝑧 ∈ 𝐵) ∧ 𝑢 = 𝐸)}
41	38, 39, 40	3eqtr4i 2798	1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑤 ∈ 𝐷, 𝑧 ∈ 𝐵 ↦ 𝐸)

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   = wceq 1570   ∈ wcel 2146  Ⅎwnfc 2912  {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  ax-sep 5259  ax-pr 5406

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 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-rab 3419  df-v 3459  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-nul 4287  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-opab 5176  df-oprab 7423  df-mpo 7424

This theorem is used by:  dmmpossx2  49176