Theorem altxpeq1 35975

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

Assertion

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

Proof of Theorem altxpeq1

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

Step	Hyp	Ref	Expression
1		rexeq 3321	. . 3 ⊢ (𝐴 = 𝐵 → (∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫))
2	1	abbidv 2807	. 2 ⊢ (𝐴 = 𝐵 → {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫} = {𝑧 ∣ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫})
3		df-altxp 35961	. 2 ⊢ (𝐴 ×× 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐴 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫}
4		df-altxp 35961	. 2 ⊢ (𝐵 ×× 𝐶) = {𝑧 ∣ ∃𝑥 ∈ 𝐵 ∃𝑦 ∈ 𝐶 𝑧 = ⟪𝑥, 𝑦⟫}
5	2, 3, 4	3eqtr4g 2801	1 ⊢ (𝐴 = 𝐵 → (𝐴 ×× 𝐶) = (𝐵 ×× 𝐶))

Syntax hints:   → wi 4   = wceq 1539  {cab 2713  ∃wrex 3069  ⟪caltop 35958   ×× caltxp 35959

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1794  ax-4 1808  ax-5 1909  ax-6 1966  ax-7 2006  ax-9 2117  ax-ext 2707

This theorem depends on definitions:  df-bi 207  df-an 396  df-ex 1779  df-sb 2064  df-clab 2714  df-cleq 2728  df-rex 3070  df-altxp 35961

This theorem is referenced by: (None)