Theorem altxpeq2 36486

Description: Equality for alternate Cartesian products. (Contributed by Scott Fenton, 24-Mar-2012.)

Assertion

Ref	Expression
altxpeq2	⊢ (𝐴 = 𝐵 → (𝐶 ×× 𝐴) = (𝐶 ×× 𝐵))

Proof of Theorem altxpeq2

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		rexeq 3322	. . . 4 ⊢ (𝐴 = 𝐵 → (∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫))
2	1	rexbidv 3192	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫))
3	2	abbidv 2832	. 2 ⊢ (𝐴 = 𝐵 → {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫} = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫})
4		df-altxp 36471	. 2 ⊢ (𝐶 ×× 𝐴) = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐴 𝑧 = ⟪𝑥, 𝑦⟫}
5		df-altxp 36471	. 2 ⊢ (𝐶 ×× 𝐵) = {𝑧 ∣ ∃𝑥 ∈ 𝐶 ∃𝑦 ∈ 𝐵 𝑧 = ⟪𝑥, 𝑦⟫}
6	3, 4, 5	3eqtr4g 2826	1 ⊢ (𝐴 = 𝐵 → (𝐶 ×× 𝐴) = (𝐶 ×× 𝐵))

This proof depends on syntax axioms:   → wi 4   = wceq 1570  {cab 2744  ∃wrex 3092  ⟪caltop 36468   ×× caltxp 36469

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-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-rex 3093  df-altxp 36471

This theorem is used by: (None)