ILE Home Intuitionistic Logic Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  ILE Home  >  Th. List  >  df-sb Structured version   Unicode version

Definition df-sb 1619
Description: Define proper substitution. Remark 9.1 in [Megill] p. 447 (p. 15 of the preprint). For our notation, we use to mean "the wff that results when is properly substituted for in the wff ." We can also use in place of the "free for" side condition used in traditional predicate calculus; see, for example, stdpc4 1631.

Our notation was introduced in Haskell B. Curry's Foundations of Mathematical Logic (1977), p. 316 and is frequently used in textbooks of lambda calculus and combinatory logic. This notation improves the common but ambiguous notation, " is the wff that results when is properly substituted for in ." For example, if the original is , then is , from which we obtain that is . So what exactly does mean? Curry's notation solves this problem.

In most books, proper substitution has a somewhat complicated recursive definition with multiple cases based on the occurrences of free and bound variables in the wff. Instead, we use a single formula that is exactly equivalent and gives us a direct definition. We later prove that our definition has the properties we expect of proper substitution (see theorems sbequ 1694, sbcom2 1836 and sbid2v 1845).

Note that our definition is valid even when and are replaced with the same variable, as sbid 1630 shows. We achieve this by having free in the first conjunct and bound in the second. We can also achieve this by using a dummy variable, as the alternate definition dfsb7 1840 shows (which some logicians may prefer because it doesn't mix free and bound variables). Another alternate definition which uses a dummy variable is dfsb7a 1843.

When and are distinct, we can express proper substitution with the simpler expressions of sb5 1740 and sb6 1739.

In classical logic, another possible definition is but we do not have an intuitionistic proof that this is equivalent.

There are no restrictions on any of the variables, including what variables may occur in wff . (Contributed by NM, 5-Aug-1993.)

Assertion
Ref Expression
df-sb

Detailed syntax breakdown of Definition df-sb
StepHypRef Expression
1 wph . . 3
2 vx . . 3  setvar
3 vy . . 3  setvar
41, 2, 3wsb 1618 . 2
52, 3weq 1365 . . . 4
65, 1wi 4 . . 3
75, 1wa 97 . . . 4
87, 2wex 1354 . . 3
96, 8wa 97 . 2
104, 9wb 98 1
Colors of variables: wff set class
This definition is referenced by:  sbimi  1620  sb1  1622  sb2  1623  sbequ1  1624  sbequ2  1625  drsb1  1653  spsbim  1697  sbequ8  1700  sbidm  1704  sb6  1739  hbsbv  1790
  Copyright terms: Public domain W3C validator