Users' Mathboxes Mathbox for Scott Fenton < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  altxpeq1 Structured version   Visualization version   GIF version

Theorem altxpeq1 33491
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.
StepHypRef Expression
1 rexeq 3397 . . 3 (𝐴 = 𝐵 → (∃𝑥𝐴𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫ ↔ ∃𝑥𝐵𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫))
21abbidv 2888 . 2 (𝐴 = 𝐵 → {𝑧 ∣ ∃𝑥𝐴𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫} = {𝑧 ∣ ∃𝑥𝐵𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫})
3 df-altxp 33477 . 2 (𝐴 ×× 𝐶) = {𝑧 ∣ ∃𝑥𝐴𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫}
4 df-altxp 33477 . 2 (𝐵 ×× 𝐶) = {𝑧 ∣ ∃𝑥𝐵𝑦𝐶 𝑧 = ⟪𝑥, 𝑦⟫}
52, 3, 43eqtr4g 2884 1 (𝐴 = 𝐵 → (𝐴 ×× 𝐶) = (𝐵 ×× 𝐶))
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1538  {cab 2802  wrex 3134  caltop 33474   ×× caltxp 33475
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1971  ax-7 2016  ax-8 2117  ax-9 2125  ax-ext 2796
This theorem depends on definitions:  df-bi 210  df-an 400  df-ex 1782  df-sb 2071  df-clab 2803  df-cleq 2817  df-clel 2896  df-rex 3139  df-altxp 33477
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator