ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  drsb1 Unicode version

Theorem drsb1 1799
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 1712 . . . . 5  |-  ( x  =  y  ->  (
x  =  z  <->  y  =  z ) )
21sps 1537 . . . 4  |-  ( A. x  x  =  y  ->  ( x  =  z  <-> 
y  =  z ) )
32imbi1d 231 . . 3  |-  ( A. x  x  =  y  ->  ( ( x  =  z  ->  ph )  <->  ( y  =  z  ->  ph )
) )
42anbi1d 465 . . . 4  |-  ( A. x  x  =  y  ->  ( ( x  =  z  /\  ph )  <->  ( y  =  z  /\  ph ) ) )
54drex1 1798 . . 3  |-  ( A. x  x  =  y  ->  ( E. x ( x  =  z  /\  ph )  <->  E. y ( y  =  z  /\  ph ) ) )
63, 5anbi12d 473 . 2  |-  ( A. x  x  =  y  ->  ( ( ( x  =  z  ->  ph )  /\  E. x ( x  =  z  /\  ph ) )  <->  ( (
y  =  z  ->  ph )  /\  E. y
( y  =  z  /\  ph ) ) ) )
7 df-sb 1763 . 2  |-  ( [ z  /  x ] ph 
<->  ( ( x  =  z  ->  ph )  /\  E. x ( x  =  z  /\  ph )
) )
8 df-sb 1763 . 2  |-  ( [ z  /  y ]
ph 
<->  ( ( y  =  z  ->  ph )  /\  E. y ( y  =  z  /\  ph )
) )
96, 7, 83bitr4g 223 1  |-  ( A. x  x  =  y  ->  ( [ z  /  x ] ph  <->  [ z  /  y ] ph ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    /\ wa 104    <-> wb 105   A.wal 1351   E.wex 1492   [wsb 1762
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-io 709  ax-5 1447  ax-7 1448  ax-gen 1449  ax-ie1 1493  ax-ie2 1494  ax-8 1504  ax-10 1505  ax-11 1506  ax-i12 1507  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534
This theorem depends on definitions:  df-bi 117  df-sb 1763
This theorem is referenced by:  sbequi  1839  nfsbxy  1942  nfsbxyt  1943  sbcomxyyz  1972  iotaeq  5188
  Copyright terms: Public domain W3C validator