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

Theorem drsb1 1969
Description: Formula-building lemma for use with the Distinctor Reduction Theorem. Part of Theorem 9.4 of [Megill] p. 448 (p. 16 of preprint). (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
drsb1  |-  ( A. x  x  =  y  ->  ( [ z  /  x ] ph  <->  [ z  /  y ] ph ) )

Proof of Theorem drsb1
StepHypRef Expression
1 equequ1 1651 . . . . 5  |-  ( x  =  y  ->  (
x  =  z  <->  y  =  z ) )
21sps 1743 . . . 4  |-  ( A. x  x  =  y  ->  ( x  =  z  <-> 
y  =  z ) )
32imbi1d 310 . . 3  |-  ( A. x  x  =  y  ->  ( ( x  =  z  ->  ph )  <->  ( y  =  z  ->  ph )
) )
42anbi1d 687 . . . 4  |-  ( A. x  x  =  y  ->  ( ( x  =  z  /\  ph )  <->  ( y  =  z  /\  ph ) ) )
54drex1 1912 . . 3  |-  ( A. x  x  =  y  ->  ( E. x ( x  =  z  /\  ph )  <->  E. y ( y  =  z  /\  ph ) ) )
63, 5anbi12d 693 . 2  |-  ( A. x  x  =  y  ->  ( ( ( x  =  z  ->  ph )  /\  E. x ( x  =  z  /\  ph ) )  <->  ( (
y  =  z  ->  ph )  /\  E. y
( y  =  z  /\  ph ) ) ) )
7 df-sb 1633 . 2  |-  ( [ z  /  x ] ph 
<->  ( ( x  =  z  ->  ph )  /\  E. x ( x  =  z  /\  ph )
) )
8 df-sb 1633 . 2  |-  ( [ z  /  y ]
ph 
<->  ( ( y  =  z  ->  ph )  /\  E. y ( y  =  z  /\  ph )
) )
96, 7, 83bitr4g 281 1  |-  ( A. x  x  =  y  ->  ( [ z  /  x ] ph  <->  [ z  /  y ] ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 6    <-> wb 178    /\ wa 360   A.wal 1529   E.wex 1530   [wsb 1632
This theorem is referenced by:  sbequi  2000  nfsb4t  2021  sbco3  2029  sbcom  2030  sb9i  2035  iotaeq  6262
This theorem was proved from axioms:  ax-1 7  ax-2 8  ax-3 9  ax-mp 10  ax-gen 1535  ax-5 1546  ax-17 1605  ax-9 1638  ax-8 1646  ax-6 1706  ax-7 1711  ax-11 1718  ax-12 1870
This theorem depends on definitions:  df-bi 179  df-an 362  df-ex 1531  df-nf 1534  df-sb 1633
  Copyright terms: Public domain W3C validator