MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  eqeq1dALT Structured version   Visualization version   Unicode version

Theorem eqeq1dALT 2625
Description: Shorter proof of eqeq1d 2624 based on more axioms. (Contributed by NM, 27-Dec-1993.) (Revised by Wolf Lammen, 19-Nov-2019.) (Proof modification is discouraged.) (New usage is discouraged.)
Hypothesis
Ref Expression
eqeq1d.1  |-  ( ph  ->  A  =  B )
Assertion
Ref Expression
eqeq1dALT  |-  ( ph  ->  ( A  =  C  <-> 
B  =  C ) )

Proof of Theorem eqeq1dALT
Dummy variable  x is distinct from all other variables.
StepHypRef Expression
1 eqeq1d.1 . . . . . 6  |-  ( ph  ->  A  =  B )
2 dfcleq 2616 . . . . . 6  |-  ( A  =  B  <->  A. x
( x  e.  A  <->  x  e.  B ) )
31, 2sylib 208 . . . . 5  |-  ( ph  ->  A. x ( x  e.  A  <->  x  e.  B ) )
4319.21bi 2059 . . . 4  |-  ( ph  ->  ( x  e.  A  <->  x  e.  B ) )
54bibi1d 333 . . 3  |-  ( ph  ->  ( ( x  e.  A  <->  x  e.  C
)  <->  ( x  e.  B  <->  x  e.  C
) ) )
65albidv 1849 . 2  |-  ( ph  ->  ( A. x ( x  e.  A  <->  x  e.  C )  <->  A. x
( x  e.  B  <->  x  e.  C ) ) )
7 dfcleq 2616 . 2  |-  ( A  =  C  <->  A. x
( x  e.  A  <->  x  e.  C ) )
8 dfcleq 2616 . 2  |-  ( B  =  C  <->  A. x
( x  e.  B  <->  x  e.  C ) )
96, 7, 83bitr4g 303 1  |-  ( ph  ->  ( A  =  C  <-> 
B  =  C ) )
Colors of variables: wff setvar class
Syntax hints:    -> wi 4    <-> wb 196   A.wal 1481    = wceq 1483    e. wcel 1990
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-9 1999  ax-12 2047  ax-ext 2602
This theorem depends on definitions:  df-bi 197  df-an 386  df-ex 1705  df-cleq 2615
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator