Theorem equequ1 1764

Description: An equivalence law for equality. (Contributed by NM, 5-Aug-1993.)

Assertion

Ref	Expression
equequ1	|- ( x = y -> ( x = z <-> y = z ) )

Proof of Theorem equequ1

Step	Hyp	Ref	Expression
1		ax-8 1557	. 2 |- ( x = y -> ( x = z -> y = z ) )
2		equtr 1761	. 2 |- ( x = y -> ( y = z -> x = z ) )
3	1, 2	impbid 129	1 |- ( x = y -> ( x = z <-> y = z ) )

This proof depends on syntax axioms:   -> wi 4   <-> wb 105

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-gen 1502  ax-ie2 1547  ax-8 1557  ax-17 1579  ax-i9 1583

This proof depends on definitions:  df-bi 117

This theorem is used by:  equveli  1812  drsb1  1852  equsb3lem  2010  euequ1  2182  axext3  2221  cbvreuvw  2792  reu6  3015  reu7  3021  reu8nf  3133  disjiun  4125  cbviota  5345  dff13f  5979  poxp  6472  dcdifsnid  6781  modom  7112  supmoti  7339  isoti  7353  nninfwlpoim  7525  exmidontriimlem3  7585  exmidontriim  7587  netap  7626  fsum2dlemstep  12226  ennnfonelemr  13372  ctinf  13379  reap0  17315