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

Theorem dfsb7a 1994
Description: An alternate definition of proper substitution df-sb 1763. Similar to dfsb7 1991 in that it involves a dummy variable  z, but expressed in terms of  A. rather than  E.. For a version which only requires  F/ z ph rather than  z and  ph being distinct, see sb7af 1993. (Contributed by Jim Kingdon, 5-Feb-2018.)
Assertion
Ref Expression
dfsb7a  |-  ( [ y  /  x ] ph 
<-> 
A. z ( z  =  y  ->  A. x
( x  =  z  ->  ph ) ) )
Distinct variable groups:    x, z    y,
z    ph, z
Allowed substitution hints:    ph( x, y)

Proof of Theorem dfsb7a
StepHypRef Expression
1 nfv 1528 . 2  |-  F/ z
ph
21sb7af 1993 1  |-  ( [ y  /  x ] ph 
<-> 
A. z ( z  =  y  ->  A. x
( x  =  z  ->  ph ) ) )
Colors of variables: wff set class
Syntax hints:    -> wi 4    <-> wb 105   A.wal 1351   [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-bndl 1509  ax-4 1510  ax-17 1526  ax-i9 1530  ax-ial 1534  ax-i5r 1535
This theorem depends on definitions:  df-bi 117  df-nf 1461  df-sb 1763
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator