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

Theorem sbelx 1973
Description: Elimination of substitution. (Contributed by NM, 5-Aug-1993.)
Assertion
Ref Expression
sbelx  |-  ( ph  <->  E. x ( x  =  y  /\  [ x  /  y ] ph ) )
Distinct variable groups:    x, y    ph, x
Allowed substitution hint:    ph( y)

Proof of Theorem sbelx
StepHypRef Expression
1 ax-17 1507 . 2  |-  ( ph  ->  A. x ph )
21sb5rf 1825 1  |-  ( ph  <->  E. x ( x  =  y  /\  [ x  /  y ] ph ) )
Colors of variables: wff set class
Syntax hints:    /\ wa 103    <-> wb 104   E.wex 1469   [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-5 1424  ax-gen 1426  ax-ie1 1470  ax-ie2 1471  ax-8 1483  ax-11 1485  ax-4 1488  ax-17 1507  ax-i9 1511  ax-ial 1515
This theorem depends on definitions:  df-bi 116  df-sb 1737
This theorem is referenced by:  sbel2x  1974
  Copyright terms: Public domain W3C validator