Theorem cbvixp 6693

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 2325	. . . . 5 ⊢ Ⅎ𝑦(𝑓‘𝑥) ∈ 𝐵
3		cbvixp.2	. . . . . 6 ⊢ Ⅎ𝑥𝐶
4	3	nfel2 2325	. . . . 5 ⊢ Ⅎ𝑥(𝑓‘𝑦) ∈ 𝐶
5		fveq2 5496	. . . . . 6 ⊢ (𝑥 = 𝑦 → (𝑓‘𝑥) = (𝑓‘𝑦))
6		cbvixp.3	. . . . . 6 ⊢ (𝑥 = 𝑦 → 𝐵 = 𝐶)
7	5, 6	eleq12d 2241	. . . . 5 ⊢ (𝑥 = 𝑦 → ((𝑓‘𝑥) ∈ 𝐵 ↔ (𝑓‘𝑦) ∈ 𝐶))
8	2, 4, 7	cbvral 2692	. . . 4 ⊢ (∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵 ↔ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)
9	8	anbi2i 454	. . 3 ⊢ ((𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵) ↔ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶))
10	9	abbii 2286	. 2 ⊢ {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)} = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)}
11		dfixp 6678	. 2 ⊢ X𝑥 ∈ 𝐴 𝐵 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑥 ∈ 𝐴 (𝑓‘𝑥) ∈ 𝐵)}
12		dfixp 6678	. 2 ⊢ X𝑦 ∈ 𝐴 𝐶 = {𝑓 ∣ (𝑓 Fn 𝐴 ∧ ∀𝑦 ∈ 𝐴 (𝑓‘𝑦) ∈ 𝐶)}
13	10, 11, 12	3eqtr4i 2201	1 ⊢ X𝑥 ∈ 𝐴 𝐵 = X𝑦 ∈ 𝐴 𝐶

Syntax hints:   → wi 4   ∧ wa 103   = wceq 1348   ∈ wcel 2141  {cab 2156  Ⅎwnfc 2299  ∀wral 2448   Fn wfn 5193  ‘cfv 5198  Xcixp 6676

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-io 704  ax-5 1440  ax-7 1441  ax-gen 1442  ax-ie1 1486  ax-ie2 1487  ax-8 1497  ax-10 1498  ax-11 1499  ax-i12 1500  ax-bndl 1502  ax-4 1503  ax-17 1519  ax-i9 1523  ax-ial 1527  ax-i5r 1528  ax-ext 2152

This theorem depends on definitions:  df-bi 116  df-3an 975  df-tru 1351  df-nf 1454  df-sb 1756  df-clab 2157  df-cleq 2163  df-clel 2166  df-nfc 2301  df-ral 2453  df-rex 2454  df-v 2732  df-un 3125  df-sn 3589  df-pr 3590  df-op 3592  df-uni 3797  df-br 3990  df-iota 5160  df-fn 5201  df-fv 5206  df-ixp 6677

This theorem is referenced by:  cbvixpv  6694  mptelixpg  6712