Symbol Reference: FFI / FV / NFV / Fresh — Syntactic Hygiene, Free-Variable & Free-For-In Predicates

Personal Symbol Reference Page in MKTD1 & MKTD2 (Morse-Kelley + Tarski + Dunaev) — All Personal Symbol Pages → | Full Symbol Registry →

Formula Display:
Proof Trees:

FFI / FV / NFV / Fresh \(\mathsf{FFI} \; / \; \mathsf{FV} \; / \; \mathsf{NFV} \; / \; \mathsf{Fresh}\) — Syntactic Hygiene, Free-Variable & Free-For-In Predicates

Explicit side-condition predicates preventing variable capture during quantifier instantiation, class comprehension, and substitution.

Field Mathematical & Kernel Specification (MKTD1 / MKTD2)
Symbol
FFI / FV / NFV / Fresh
\(\mathsf{FFI} \; / \; \mathsf{FV} \; / \; \mathsf{NFV} \; / \; \mathsf{Fresh}\)
Category Syntactic Hygiene & Substitution
SML AST Constructor HC (CpFV of (UCol * 'a)), HC (CpCtxFV of 'Ctx_EXP), HP (TpFFI of (UCol * 'a * 'Variable_EXP * 'Truth_Expression_EXP)) [typetheory.ML:575-576, 683]
Constructor Arguments FV: 1. Expression e : A.Expression; FFI: 1. Term t : X.Expression, 2. Variable x : Variable, 3. Formula 𝛗 : Fm
Metatype / Signature Meta-Predicates on Variables, Terms, and Formulas
Binder Status No β€” Primitive Syntactic Hygiene Functional & Predicate Symbols
Defining Kernel Entries (ML Labels) Inference Rule RulClassComprehension (3.01): Class comprehension (#RulClassComprehension / #label-class-comprehension)
LaTeX Form \mathsf{FFI} \; / \; \mathsf{FV} \; / \; \mathsf{NFV} \; / \; \mathsf{Fresh}
How to Understand It

Meaning of Each Hygiene Predicate:

  • FV(𝛂) (Free Variables): The set/collection of syntactic variables occurring free in formula or expression 𝛂.
  • NFV(e, x) / Fresh(x, 𝛂) (Not Free Variable / Freshness): Asserts that variable x does not occur free in e (or 𝛂). Crucial in Class Comprehension (Entry DefIsSet (3.02) / DefMetaInstantiation (4.01)) to prevent circular Russell-style capture where the defined class variable occurs free in its own defining formula, and in Universal Generalisation (Entry RulExistsInstantiation (2.03) / DefMetaGeneralisation (4.02)) to verify x βˆ‰ FV(π’ž).
  • FFI(t, x, 𝛂) (Free For In / Capture-Avoiding Substitutability): Asserts that term t is free for variable x in formula 𝛂 (no free variable of t becomes captured by a binder in 𝛂 when substituting t for free occurrences of x). Used in Entries RulForallInstantiation (2.02), RulExistsAbstraction (2.05), and DefMetaConecessitation (4.03)–AxmMetaClassComprehension (4.06).
Canonical Law / Usage FFI(t, x, 𝛂) β‡’ ((βˆ€x:Class. 𝛂) β‡’ (let x ↀ t in 𝛂))
Related Symbols & Kernel Entries

Defining Axioms, Rules & Formal Definitions (Rendered Directly from Kernel Entries)

Generated without code duplication by invoking render_entry_row_base "../manual.html" on the corresponding kernel Entry records.

# Formal Entity Specification
3.01
Title Class comprehension #RulClassComprehension #label-class-comprehension
Classification Inference Rule
Formula
0\(\href{../symbols/delimiters-brackets.html}{(} \href{../symbols/delimiters-brackets.html}{(} \href{../symbols/binder-brackets.html}{\{\!\lvert } \href{../symbols/variables.html}{x} \href{../symbols/binder-brackets.html}{\rvert\!\}} \href{../symbols/in-pred.html}{\in} \href{../symbols/class-comprehension.html}{\{} \href{../symbols/binder-brackets.html}{\{\!\lvert } \href{../symbols/variables.html}{x} \href{../symbols/binder-brackets.html}{\rvert\!\}} \href{../symbols/class-comprehension.html}{ \mid } \href{../symbols/antiquotation.html}{[\![ } \href{../symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{../symbols/antiquotation.html}{ ]\!]} \href{../symbols/class-comprehension.html}{\}} \href{../symbols/delimiters-brackets.html}{)} \href{../symbols/iff-conn.html}{\longleftrightarrow} \href{../symbols/delimiters-brackets.html}{(} \href{../symbols/delimiters-brackets.html}{(} \href{../symbols/binder-brackets.html}{\{\!\lvert } \href{../symbols/variables.html}{x} \href{../symbols/binder-brackets.html}{\rvert\!\}} \href{../symbols/set-pred.html}{\mathsf{set}} \href{../symbols/delimiters-brackets.html}{)} \href{../symbols/and-conn.html}{\land} \href{../symbols/antiquotation.html}{[\![ } \href{../symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{../symbols/antiquotation.html}{ ]\!]} \href{../symbols/delimiters-brackets.html}{)} \href{../symbols/delimiters-brackets.html}{)} \)
SML Kernel AST PComprAx_prf
Scheme of Types 0(([⦃[x@Variable.Expression]⦄@Class.Expression]∈{[⦃[x@Variable.Expression]⦄@Class.Expression]|⟦[𝛗@Fm.Expression]⟧})⟷(([⦃[x@Variable.Expression]⦄@Class.Expression] set)∧⟦[𝛗@Fm.Expression]⟧))
Judgements
1\(\href{../symbols/image-op.html}{[} \href{../symbols/delimiters-brackets.html}{(} \href{../symbols/variables.html}{x} \href{../symbols/typing-colon.html}{:} \href{../symbols/name-sort.html}{\mathsf{Name}} \href{../symbols/delimiters-brackets.html}{)} \href{../symbols/comma-delim.html}{,} \href{../symbols/delimiters-brackets.html}{(} \href{../symbols/formula-metavariables.html}{\boldsymbol{\varphi}} \href{../symbols/typing-colon.html}{:} \href{../symbols/fm-sort.html}{\mathsf{Fm}} \href{../symbols/delimiters-brackets.html}{)} \href{../symbols/image-op.html}{]} \)
Side Condition
1\(\href{../symbols/top-const.html}{\top} \)
Verification Primitive / Derived Rule (Kernel) · Standalone Entry (RulClassComprehension) → · (3.01) · #RulClassComprehension