HomeHome Metamath Proof Explorer < Previous   Next >
Related theorems
Unicode version

Theorem dfsb7 1340
Description: An alternate definition of proper substitution df-sb 1172. By introducing a dummy variable z in the definiens, we are able to eliminate any distinct variable restrictions among the variables x, y, and ph of the definiendum. No distinct variable conflicts arise because z effectively insulates x from y. To achieve this, we use a chain of two substitutions in the form of sb5 1268, first z for x then y for z. Compare Definition 2.1'' of [Quine] p. 17, which is obtained from this theorem by applying df-clab 1464. Theorem sb7f 1341 provides a version where ph and z don't have to be distinct.
Assertion
Ref Expression
dfsb7 |- ([y / x]ph <-> E.z(z = y /\ E.x(x = z /\ ph)))
Distinct variable groups:   x,z   y,z   ph,z

Proof of Theorem dfsb7
StepHypRef Expression
1 sb5 1268 . . 3 |- ([z / x]ph <-> E.x(x = z /\ ph))
21sbbii 1174 . 2 |- ([y / z][z / x]ph <-> [y / z]E.x(x = z /\ ph))
3 ax-17 970 . . 3 |- (ph -> A.zph)
43sbco2 1255 . 2 |- ([y / z][z / x]ph <-> [y / x]ph)
5 sb5 1268 . 2 |- ([y / z]E.x(x = z /\ ph) <-> E.z(z = y /\ E.x(x = z /\ ph)))
62, 4, 53bitr3 181 1 |- ([y / x]ph <-> E.z(z = y /\ E.x(x = z /\ ph)))
Colors of variables: wff set class
Syntax hints:   <-> wb 146   /\ wa 223   = wceq 955  E.wex 979  [wsbc 1170
This theorem is referenced by:  sb7f 1341
This theorem was proved from axioms:  ax-1 4  ax-2 5  ax-3 6  ax-mp 7  ax-7 961  ax-gen 962  ax-8 963  ax-9 964  ax-10 965  ax-11 966  ax-12 967  ax-17 970  ax-4 972  ax-5o 974  ax-6o 977  ax-9o 1122  ax-10o 1139  ax-16 1210  ax-11o 1218
This theorem depends on definitions:  df-bi 147  df-or 224  df-an 225  df-ex 980  df-sb 1172
Copyright terms: Public domain