Theorem cbvmpo1 46386

Description: Rule to change the first bound variable in a maps-to function, using implicit substitution. (Contributed by Glauco Siliprandi, 26-Jun-2021.)

Hypotheses

Ref	Expression
cbvmpo1.1	⊢ Ⅎ𝑥𝐵
cbvmpo1.2	⊢ Ⅎ𝑧𝐵
cbvmpo1.3	⊢ Ⅎ𝑧𝐶
cbvmpo1.4	⊢ Ⅎ𝑥𝐸
cbvmpo1.5	⊢ (𝑥 = 𝑧 → 𝐶 = 𝐸)

Assertion

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

Distinct variable groups:   𝑥,𝐴,𝑧   𝑥,𝑦,𝑧

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

Proof of Theorem cbvmpo1

Dummy variable 𝑢 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		nfv 1949	. . . . 5 ⊢ Ⅎ𝑧 𝑥 ∈ 𝐴
2		cbvmpo1.2	. . . . . 6 ⊢ Ⅎ𝑧𝐵
3	2	nfcri 2918	. . . . 5 ⊢ Ⅎ𝑧 𝑦 ∈ 𝐵
4	1, 3	nfan 1934	. . . 4 ⊢ Ⅎ𝑧(𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
5		cbvmpo1.3	. . . . 5 ⊢ Ⅎ𝑧𝐶
6	5	nfeq2 2943	. . . 4 ⊢ Ⅎ𝑧 𝑢 = 𝐶
7	4, 6	nfan 1934	. . 3 ⊢ Ⅎ𝑧((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)
8		nfv 1949	. . . . 5 ⊢ Ⅎ𝑥 𝑧 ∈ 𝐴
9		cbvmpo1.1	. . . . . 6 ⊢ Ⅎ𝑥𝐵
10	9	nfcri 2918	. . . . 5 ⊢ Ⅎ𝑥 𝑦 ∈ 𝐵
11	8, 10	nfan 1934	. . . 4 ⊢ Ⅎ𝑥(𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)
12		cbvmpo1.4	. . . . 5 ⊢ Ⅎ𝑥𝐸
13	12	nfeq2 2943	. . . 4 ⊢ Ⅎ𝑥 𝑢 = 𝐸
14	11, 13	nfan 1934	. . 3 ⊢ Ⅎ𝑥((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)
15		eleq1w 2847	. . . . 5 ⊢ (𝑥 = 𝑧 → (𝑥 ∈ 𝐴 ↔ 𝑧 ∈ 𝐴))
16	15	anbi1d 643	. . . 4 ⊢ (𝑥 = 𝑧 → ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ↔ (𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵)))
17		cbvmpo1.5	. . . . 5 ⊢ (𝑥 = 𝑧 → 𝐶 = 𝐸)
18	17	eqeq2d 2774	. . . 4 ⊢ (𝑥 = 𝑧 → (𝑢 = 𝐶 ↔ 𝑢 = 𝐸))
19	16, 18	anbi12d 644	. . 3 ⊢ (𝑥 = 𝑧 → (((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶) ↔ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)))
20	7, 14, 19	cbvoprab1 7538	. 2 ⊢ {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)} = {⟨⟨𝑧, 𝑦⟩, 𝑢⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)}
21		df-mpo 7456	. 2 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = {⟨⟨𝑥, 𝑦⟩, 𝑢⟩ ∣ ((𝑥 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐶)}
22		df-mpo 7456	. 2 ⊢ (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐸) = {⟨⟨𝑧, 𝑦⟩, 𝑢⟩ ∣ ((𝑧 ∈ 𝐴 ∧ 𝑦 ∈ 𝐵) ∧ 𝑢 = 𝐸)}
23	20, 21, 22	3eqtr4i 2796	1 ⊢ (𝑥 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐶) = (𝑧 ∈ 𝐴, 𝑦 ∈ 𝐵 ↦ 𝐸)

This proof depends on syntax axioms:   ∧ wa 401   = wceq 1570   ∈ wcel 2147  Ⅎwnfc 2911  {coprab 7452   ∈ cmpo 7453

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-pr 5398

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 2102  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-sn 4589  df-pr 4591  df-op 4841  df-opab 5174  df-oprab 7455  df-mpo 7456

This theorem is used by: (None)