Definition df-nf 1710

Description: Define the not-free predicate for wffs. This is read " x is not free in ph". Not-free means that the value of x cannot affect the value of ph, e.g., any occurrence of x in ph is effectively bound by a "for all" or something that expands to one (such as "there exists"). In particular, substitution for a variable not free in a wff does not affect its value (sbf 2380). An example of where this is used is stdpc5 2076. See nf5 2116 for an alternate definition which involves nested quantifiers on the same variable.

Not-free is a commonly used constraint, so it is useful to have a notation for it. Surprisingly, there is no common formal notation for it, so here we devise one. Our definition lets us work with the not-free notion within the logic itself rather than as a metalogical side condition.

To be precise, our definition really means "effectively not free," because it is slightly less restrictive than the usual textbook definition for not-free (which only considers syntactic freedom). For example, x is effectively not free in the formula x = x (see nfequid 1940), even though x would be considered free in the usual textbook definition, because the value of x in the formula x = x cannot affect the truth of that formula (and thus substitutions will not change the result).

This definition of not-free tightly ties to the quantifier A. x. At this state (no axioms restricting quantifiers yet) 'non-free' appears quite arbitrary. Its intended semantics expresses single-valuedness (constness) across a parameter, but is only evolved as much as later axioms assign properties to quantifiers. It seems the definition here is best suited in situations, where axioms are only partially in effect. In particular, this definition more easily carries over to other logic models with weaker axiomization.

The reverse implication of the definiens (the right hand side of the biconditional) always holds, see 19.2 1892.

This predicate only applies to wffs. See df-nfc 2753 for a not-free predicate for class variables. (Contributed by Mario Carneiro, 24-Sep-2016.) Converted to definition. (Revised by BJ, 6-May-2019.)

Assertion

Ref	Expression
df-nf	|- ( F/ x ph <-> ( E. x ph -> A. x ph ) )

Detailed syntax breakdown of Definition df-nf

Step	Hyp	Ref	Expression
1		wph	. . 3 wff ph
2		vx	. . 3 setvar x
3	1, 2	wnf 1708	. 2 wff F/ x ph
4	1, 2	wex 1704	. . 3 wff E. x ph
5	1, 2	wal 1481	. . 3 wff A. x ph
6	4, 5	wi 4	. 2 wff ( E. x ph -> A. x ph )
7	3, 6	wb 196	1 wff ( F/ x ph <-> ( E. x ph -> A. x ph ) )

This definition is referenced by:  nf2  1711  nfi  1714  nfri  1715  nfd  1716  nfrd  1717  nftht  1718  19.38a  1767  19.38b  1768  nfbiit  1777  nfimt  1821  nfnf1  2031  nf5r  2064  19.9d  2070  nfbidf  2092  nf5  2116  nf6  2117  nfnf  2158  nfeqf2  2297  sbnf2  2439  dfnf5  3952  bj-alrimhi  32604  bj-ssbft  32642