Theorem cbvixp 6769

Description: Change bound variable in an indexed Cartesian product. (Contributed by Jeff Madsen, 20-Jun-2011.)

Hypotheses

Ref	Expression
cbvixp.1	⊢ Ⅎ𝑦𝐵
cbvixp.2	⊢ Ⅎ𝑥𝐶
cbvixp.3	⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)

Assertion

Ref	Expression
cbvixp	⊢ X𝑥 ∈ 𝐴 𝐵 = X𝑦 ∈ 𝐴 𝐶

Distinct variable group:   𝑥,𝐴,𝑦

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

Proof of Theorem cbvixp

Dummy variable 𝑓 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		cbvixp.1	. . . . . 6 ⊢ Ⅎ𝑦𝐵
2	1	nfel2 2349	. . . . 5 ⊢ Ⅎ𝑦(𝑓‘𝑥) ∈ 𝐵
3		cbvixp.2	. . . . . 6 ⊢ Ⅎ𝑥𝐶
4	3	nfel2 2349	. . . . 5 ⊢ Ⅎ𝑥(𝑓‘𝑦) ∈ 𝐶
5		fveq2 5554	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑓‘𝑥) = (𝑓‘𝑦))
6		cbvixp.3	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)
7	5, 6	eleq12d 2264	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑓‘𝑥) ∈ 𝐵 ↔ (𝑓‘𝑦) ∈ 𝐶))
8	2, 4, 7	cbvral 2722	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)
9	8	anbi2i 457	. . 3 ⊢ ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶))
10	9	abbii 2309	. 2 ⊢ {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)}
11		dfixp 6754	. 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)}
12		dfixp 6754	. 2 ⊢ X𝑦 ∈ 𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)}
13	10, 11, 12	3eqtr4i 2224	1 ⊢ X𝑥 ∈ 𝐴 𝐵 = X𝑦 ∈ 𝐴 𝐶

Syntax hints:   → wi 4   ∧ wa 104   = wceq 1364   ∈ wcel 2164  {cab 2179  Ⅎwnfc 2323  ∀wral 2472   Fn wfn 5249  ‘cfv 5254  Xcixp 6752

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-ext 2175

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-nf 1472  df-sb 1774  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ral 2477  df-rex 2478  df-v 2762  df-un 3157  df-sn 3624  df-pr 3625  df-op 3627  df-uni 3836  df-br 4030  df-iota 5215  df-fn 5257  df-fv 5262  df-ixp 6753

This theorem is referenced by:  cbvixpv  6770  mptelixpg  6788