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

Theorem altopeq12 35003
Description: Equality for alternate ordered pairs. (Contributed by Scott Fenton, 22-Mar-2012.)
Assertion
Ref Expression
altopeq12 ((𝐴 = 𝐵𝐶 = 𝐷) → ⟪𝐴, 𝐶⟫ = ⟪𝐵, 𝐷⟫)

Proof of Theorem altopeq12
StepHypRef Expression
1 sneq 4638 . . 3 (𝐴 = 𝐵 → {𝐴} = {𝐵})
2 sneq 4638 . . 3 (𝐶 = 𝐷 → {𝐶} = {𝐷})
31, 2anim12i 613 . 2 ((𝐴 = 𝐵𝐶 = 𝐷) → ({𝐴} = {𝐵} ∧ {𝐶} = {𝐷}))
4 altopthsn 35002 . 2 (⟪𝐴, 𝐶⟫ = ⟪𝐵, 𝐷⟫ ↔ ({𝐴} = {𝐵} ∧ {𝐶} = {𝐷}))
53, 4sylibr 233 1 ((𝐴 = 𝐵𝐶 = 𝐷) → ⟪𝐴, 𝐶⟫ = ⟪𝐵, 𝐷⟫)
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 396   = wceq 1541  {csn 4628  caltop 34997
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 1913  ax-6 1971  ax-7 2011  ax-8 2108  ax-9 2116  ax-ext 2703  ax-sep 5299  ax-nul 5306  ax-pr 5427
This theorem depends on definitions:  df-bi 206  df-an 397  df-or 846  df-tru 1544  df-fal 1554  df-ex 1782  df-sb 2068  df-clab 2710  df-cleq 2724  df-clel 2810  df-v 3476  df-dif 3951  df-un 3953  df-in 3955  df-ss 3965  df-nul 4323  df-sn 4629  df-pr 4631  df-altop 34999
This theorem is referenced by:  altopeq1  35004  altopeq2  35005
  Copyright terms: Public domain W3C validator