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

Theorem sbequ6 1757
Description: Substitution does not change a distinctor. (Contributed by NM, 5-Aug-1993.) (Revised by NM, 14-May-2005.)
Assertion
Ref Expression
sbequ6  |-  ( [ w  /  z ]  -.  A. x  x  =  y  <->  -.  A. x  x  =  y )

Proof of Theorem sbequ6
StepHypRef Expression
1 nfnae 1701 . 2  |-  F/ z  -.  A. x  x  =  y
21sbf 1751 1  |-  ( [ w  /  z ]  -.  A. x  x  =  y  <->  -.  A. x  x  =  y )
Colors of variables: wff set class
Syntax hints:   -. wn 3    <-> wb 104   A.wal 1330   [wsb 1736
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 105  ax-ia2 106  ax-ia3 107  ax-in1 604  ax-in2 605  ax-io 699  ax-5 1424  ax-7 1425  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-10 1484  ax-11 1485  ax-i12 1486  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515
This theorem depends on definitions:  df-bi 116  df-tru 1335  df-fal 1338  df-nf 1438  df-sb 1737
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator