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

Theorem equequ2 1761
Description: An equivalence law for equality. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
equequ2  |-  ( x  =  y  ->  (
z  =  x  <->  z  =  y ) )

Proof of Theorem equequ2
StepHypRef Expression
1 equtrr 1758 . 2  |-  ( x  =  y  ->  (
z  =  x  -> 
z  =  y ) )
2 equtrr 1758 . . 3  |-  ( y  =  x  ->  (
z  =  y  -> 
z  =  x ) )
32equcoms 1756 . 2  |-  ( x  =  y  ->  (
z  =  y  -> 
z  =  x ) )
41, 3impbid 129 1  |-  ( x  =  y  ->  (
z  =  x  <->  z  =  y ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105
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-gen 1498  ax-ie2 1543  ax-8 1553  ax-17 1575  ax-i9 1579
This theorem depends on definitions:  df-bi 117
This theorem is referenced by:  ax11v2  1869  ax11v  1876  ax11ev  1877  equs5or  1879  eujust  2084  euf  2087  mo23  2124  eleq1w  2295  cbvabw  2359  csbcow  3152  disjiun  4109  iotaval  5329  dffun4f  5373  dff13f  5949  modom  7074  supmoti  7297  isoti  7311  nninfwlpoim  7483  exmidontriim  7545  netap  7584  ennnfonelemr  13258  ctinf  13265  infpn2  13291  lgseisenlem2  16070
  Copyright terms: Public domain W3C validator