OctoInformBeta

OpenAI preprint, September 2026 · §5. Observation spaces and substitution-stable candidates

Lemma 30: Stored typing substitutions preserve goodness and evaluation under the activity guard

Substitution preserves good observations.

Hover over a blue or green term in the text, or a node in the graph, to find it in the other. Select it to read its declaration both in Lean and in words.

The Setting

Substitution changes both a term and the types at which it is observed. An observation substitution must account for the actual replacement terms and for the parameters attached to their declarations.

Let P=(S,𝒜,ℛ)P=(S,\mathcal A,\mathcal R) be a pure type specification, with arbitrary axiom and product-rule relations. Terms include annotated abstractions λx:A.M\lambda x:A.M and dependent products Πx:A.B\Pi x:A.B. Assume system weak normalization: every term occurring as a subject or an expected type in a typing judgment in a valid context has a β\beta normal form.✦ Write M#M^\# for its chosen normal form when one exists and a fixed fallback otherwise.✦ Full β\beta reduction acts in annotations and binder bodies as well as applications; β\beta convertibility is its equivalence closure. A valid context is obtained from the empty context by adjoining declarations whose types have some sort.✦

A saturated context tower Ω\Omega is a tower of valid contexts whose prefixes have length equal to their stage, extend by one sortable declaration, and declare each sortable fixed-level type arbitrarily far along the tower.✦ The judgment Ω⊢M:A\Omega\vdash M:A means that some prefix types both expressions after translating their free levels to indices.✦ Contexts below are newest-first lists with de Bruijn indices, and Γ(i)=A\Gamma(i)=A denotes a declaration’s type viewed in the full context, including its index shifts.✦ Simultaneous substitution M[ξ]M[\xi] lifts beneath binders, fixing the bound index zero and shifting the free indices of each replacement.

The normal form profiles and the axiom and product output profiles are those in (1). πΓ(T)={s∈S∣Γ⊢T#:s},πΩ(T)={s∈S∣Ω⊢T#:s},Ax⁡(s)={t∣(s,t)∈𝒜},Out⁡(I,J)={c∣∃a∈I,b∈J,(a,b,c)∈ℛ}.\begin{aligned} \pi_\Gamma(T)&=\{s\in S\mid\Gamma\vdash T^\#:s\},& \pi_\Omega(T)&=\{s\in S\mid\Omega\vdash T^\#:s\},\\ \operatorname{Ax}(s)&=\{t\mid(s,t)\in\mathcal A\},& \operatorname{Out}(I,J)&=\{c\mid\exists a\in I,\ b\in J,\ (a,b,c)\in\mathcal R\}. \end{aligned}(1) A feasible profile is a nonempty πΓ(T)\pi_\Gamma(T) for a normal TT in a valid Γ\Gamma.✦ A feasible product triple (I,J,K)(I,J,K) consists of feasible profiles with K=Out⁡(I,J)K=\operatorname{Out}(I,J).✦ The primary signed graph has positive edges I→JI\to J for strict inclusions J⊊IJ\subsetneq I of feasible profiles, negative edges I→KI\to K for feasible product triples, and positive edges J→KJ\to K for those triples.✦

Fix a family CC of profiles. The observation layers ℒC\mathcal L_C of a family CC of profiles are the profiles reachable along positive primary edges from a nonempty Ax⁡(s)\operatorname{Ax}(s) with {s}∈C\{s\}\in C.✦ The secondary graph retains positive primary edges between observation layers and has a negative edge I→KI\to K when (I,J,K)(I,J,K) is a feasible product triple entirely in ℒC\mathcal L_C.✦ A direct layer II is an observation layer for which there are profiles J,K∈CJ,K\in C forming a feasible product triple (I,J,K)(I,J,K).✦ An active layer II is a profile with a directed secondary walk from II to a direct layer; write Act⁡(I)\operatorname{Act}(I).✦ A walk’s sign is the parity of its negative edges, with the empty walk positive.✦ A plain layer II is a profile with secondary walks of both signs from II to direct layers.✦ A free layer II of sign ε\varepsilon is a profile that is not plain and has a secondary walk of sign ε\varepsilon to a direct layer.✦

A strongly connected component consists of exactly the vertices mutually reachable with one of its vertices.✦ For the observation spaces, exclude a forbidden configuration: a strongly connected secondary component DD consisting of plain layers, containing a negative edge, and admitting a feasible product triple (I,J,K)(I,J,K) and a sort ss with J,K,{s}∈DJ,K,\{s\}\in D, nonempty Ax⁡(s)\operatorname{Ax}(s), and a positive primary walk from Ax⁡(s)\operatorname{Ax}(s) to II.✦

Observation Environments and Substitutions

The top family TopT\mathrm{Top}_T consists of the strongly normalizing terms typed at TT in Ω\Omega.✦ A tested stack at a type is an argument list that is empty or, at Πx:A.B\Pi x:A.B, begins with a∈TopAa\in\mathrm{Top}_A and continues with a tested stack at (B[a/x])#(B[a/x])^\#.✦ The ground family GTG_T consists of terms typed at TT whose application to every tested argument stack is strongly normalizing.✦ A normalization candidate at TT is a set between GTG_T and TopT\mathrm{Top}_T closed under typed head expansion when the annotation, abstraction body and contracted argument are strongly normalizing and the remaining argument list is strongly normalizing.✦ Argument list reduction reduces one argument by one β\beta step✦; a strongly normalizing argument list admits no infinite sequence of these steps.✦ An actual type is a normal sortable expression or a literal sort.✦ A candidate assignment chooses a normalization candidate at each actual type.✦

For a domain DD, body EE, tester set AA and family ℱ(n)\mathcal F(n) of sets of terms, the indexed product test consists of the terms in TopΠx:D.E\mathrm{Top}_{\Pi x:D.E} that send every n∈An\in A into every member of ℱ(n)\mathcal F(n).✦

The top candidate assignment chooses TopT\mathrm{Top}_T at every actual type TT.✦

A normalized active type is a normal sortable type with active profile.✦ A plain observation at a normalized active type TT with plain profile is a recursively parameterized table of candidate assignments on finite application paths.✦ An application key for a type TT is a decomposition of TT as Πx:A.B\Pi x:A.B together with a normal term aa with Ω⊢a:A\Omega\vdash a:A and active target (B[a/x])#(B[a/x])^\#.✦ Its domain parameter is present when AA is active. A tagged plain observation is a pair consisting of a normalized plain type and a plain observation table at that type.✦ The prefix decomposition of a plain observation at TT consists of its candidate assignment at the empty path and, for every application key, a continuation sending each choice of its domain parameter to a plain observation at the target.✦ For a plain application key, an active domain AA is itself a normalized plain type✦; its domain parameter is a plain observation at AA.

A free observation frame has an expression as key and a payload that is absent, plain, or of the opposite free sign.✦ A continuation stack is a finite list of free observation frames✦, and an exit stack consists of continuing frames followed by a terminal exit frame.✦ A free observation table is a function assigning candidate assignments to continuation stacks and optional tagged plain observations to exit stacks.✦ The negative space is the direct limit of finite stages, starting from the empty stage and taking two successive table spaces at each step✦; the positive space is the table space with negative opposite values.✦ Negative observations have represented table behaviors with positive opposite values.✦ The slice of a free observation table at a frame is the table obtained by prefixing that frame to every continuation stack and to the continuing part of every exit stack.✦

For a candidate assignment bb and an optional tagged plain observation oo, the constant observation table with base bb and exit result oo is the table returning bb on every continuation stack and oo on every exit stack.✦ The default positive observation with base bb and exit result oo is the constant table with those values in the positive observation space.✦ The default negative observation with base bb and exit result oo is the negative observation represented by the stage-one constant table with those values.✦

For a negative observation mm and a frame with positive opposite values, the negative observation slice of mm at that frame is a negative observation representing the slice of the represented behavior of mm.✦

A raw observation is tagged plain, positive or negative.✦ A typed observation value at TT is a raw observation compatible with TT: a plain tag has type exactly TT, while a positive or negative tag requires the corresponding free profile of TT.✦ Write 𝒱(T)\mathscr V(T) for these typed values and Fits⁡(T,v)\operatorname{Fits}(T,v) for compatibility. The optional payload condition in (2) distinguishes inactive declarations. Payload⁡(T,p)⇔{¬Act⁡(πΩ(T)),p=⌀,Fits⁡(T,v),p=some⁡(v).\operatorname{Payload}(T,p)\quad\Longleftrightarrow\quad \begin{cases} \neg\operatorname{Act}(\pi_\Omega(T)),&p=\varnothing,\\ \operatorname{Fits}(T,v),&p=\operatorname{some}(v). \end{cases}(2)✦ A free application gate at TT for an expression key qq, optional payload pp and exit flag holds when an active application key at TT has argument qq and a compatible payload pp at its domain, and its target is plain exactly when the exit flag is true.✦

A typed observation environment e=(ξ,p)e=(\xi,p) on Γ\Gamma is a raw actual substitution ξ\xi and an optional observation assignment pp satisfying (3) at each declaration. Γ(i)=A⇒Ω⊢ξi:A[ξ]andPayload⁡((A[ξ])#,pi).\Gamma(i)=A\quad\Longrightarrow\quad \Omega\vdash\xi_i:A[\xi] \quad\text{and}\quad \operatorname{Payload}\bigl((A[\xi])^\#,p_i\bigr).(3)✦ A tower typed substitution ξ\xi on Γ\Gamma is a raw actual substitution satisfying the typing condition in (3) at each declaration.✦

A stored typing tree tt for Γ⊢M:T\Gamma\vdash M:T is a finite derivation retaining its chosen variable declaration, sort axiom or formation rule and the root conversion.✦ Structural observation evaluation follows this tree. Its outputs are the observation value and candidate readout in (4); the value is available under the activity condition displayed there. Val⁡t(e)∈𝒱((T[ξ])#)when Act⁡(πΩ((T[ξ])#)),Read⁡t(e) is a candidate at (M[ξ])#.\begin{aligned} \operatorname{Val}_t(e)&\in\mathscr V\bigl((T[\xi])^\#\bigr) &&\text{when }\operatorname{Act}\bigl(\pi_\Omega((T[\xi])^\#)\bigr),\\ \operatorname{Read}_t(e)&\text{ is a candidate at }(M[\xi])^\#. \end{aligned}(4)✦ The optional evaluation parameter par⁡t(e)\operatorname{par}_t(e) is the raw value of Val⁡t(e)\operatorname{Val}_t(e) when the target is active and is absent otherwise.✦ Write |v||v| for a typed value’s raw observation and |A||A| for a candidate’s set of terms.

Write D::ΓD::\Gamma for Γ\Gamma extended by a newest declaration of type DD. A product instance consists of a context Γ\Gamma, domain DD, body EE, an environment ee on Γ\Gamma, and sorts a,b,ca,b,c with Γ⊢D:a\Gamma\vdash D:a, D::Γ⊢E:bD::\Gamma\vdash E:b and (a,b,c)∈ℛ(a,b,c)\in\mathcal R.✦ Write DeD_e, EeE_e and Fe(n)F_e(n) for its normalized substituted domain, normalized substituted body and normalized instantiated target at nn. A family of payload-indexed body candidates for a product instance assigns a candidate at Fe(n)F_e(n) to every nn with Ω⊢n:De\Omega\vdash n:D_e and every optional observation payload compatible with DeD_e.✦ For a product instance and a candidate dd at DeD_e, the product tester set is |d||d| when πΩ(De)∈C\pi_\Omega(D_e)\in C, and is TopDe\mathrm{Top}_{D_e} otherwise.✦ The product candidate fibers at nn are empty unless Ω⊢n:De\Omega\vdash n:D_e. For a typed nn, they consist of all the body candidate sets indexed by compatible payloads when πΩ(Fe(n))∈C\pi_\Omega(F_e(n))\in C, and otherwise consist of the single set TopFe(n)\mathrm{Top}_{F_e(n)}. The product test candidate for a product instance, domain candidate and payload-indexed body candidates is the indexed product test at Πx:De.Ee\Pi x:D_e.E_e with their product tester set and product candidate fibers; it is a normalization candidate.✦ When T=Πx:De.EeT=\Pi x:D_e.E_e is a normalized active type, a term nn typed at DeD_e whose instantiated target is active determines a normalized argument frame: the active application key with argument n#n^\# and normalized target Fe(n)F_e(n).✦ For a product instance with normalized product TT, an active application key at TT and a compatible optional domain payload determine its application frame environment by extending ee with the key’s argument and that payload.✦

Updating a candidate assignment at an actual type TT replaces its candidate at TT by the specified candidate and retains all its other coordinates.✦ The observation base assignment of a raw value is the candidate assignment at the empty observation: the first coordinate of a plain prefix, the empty-stack continuing result of a positive table, or that result in a negative value’s represented behavior.✦ Write ξe\xi_e for the raw substitution of ee. For a subject MM, expected type TT, typed observation environment ee and raw observation value, the base candidate readout is that value’s observation base assignment evaluated at (M[ξe])#(M[\xi_e])^\# when that subject’s profile belongs to CC, the original expected type is a literal sort ss with {s}∈C\{s\}\in C, and (T[ξe])#(T[\xi_e])^\# is active. In every other case it is Top(M[ξe])#\mathrm{Top}_{(M[\xi_e])^\#}.

The default plain observation at a normalized plain type is the constant plain table with the top candidate assignment as its value.✦ The distinguished observation at a normalized active type TT is its canonical typed observation value in 𝒱(T)\mathscr V(T).✦ Typed value projection at a normalized active type TT retains a raw observation vv when Fits⁡(T,v)\operatorname{Fits}(T,v) holds, and otherwise returns the distinguished observation at TT.✦ The checked exit value at a normalized active type TT is the distinguished observation when the exit is absent, and otherwise is the typed value projection at TT of the exiting plain tag.✦ The prescribed base observation at a normalized active type TT with candidate assignment bb is a typed observation value whose empty observation is bb and whose nonempty observations agree with the distinguished default.✦

Plain observation application takes a typed value at a normalized plain type, an active application key and a compatible optional domain payload to the typed observation at the target selected by its plain prefix continuation.✦ Observation value application sends a typed value at a normalized active type, an active application key and a compatible optional domain payload to a typed value at the key’s active target, using a plain continuation, a free continuation slice or a checked exit according to the source and target tags.✦

A lambda observation action at a normalized active type TT assigns a typed observation value at the active target to every active application key at TT and every compatible optional payload at its domain.✦ For a lambda observation action, a lambda exit decodes a frame payload and returns the plain tag of that action at the gated key when the free application gate holds with exit flag true; otherwise it is absent.✦ The plain lambda prefix at a normalized plain type is the typed observation whose continuation at each application key applies the lambda action with its unique optional domain payload, at the instantiated target.✦ The continuation gate is the free application gate with exit flag false. The positive lambda continuation follows the positive value supplied by the lambda action when the continuation gate holds after decoding the frame payload; otherwise it returns the default positive observation with top candidate assignment and absent exit.✦ The negative lambda continuation follows the negative value supplied by the lambda action when the continuation gate holds after decoding the frame payload; otherwise it returns the default negative observation with top candidate assignment and absent exit.✦

A raw lambda table has a base result, a negative body observation selected by each first frame, and an exit action: it returns the base on the empty continuation, the exit action on a lone terminal frame, and otherwise the selected body’s represented behavior on the remaining stack.✦ The positive lambda table has top candidate assignment at the empty continuation, follows the positive lambda continuation on a nonempty continuation, and uses the lambda exit on a lone terminal frame; after an initial continuing frame, its exit result is read from the selected continuation on the remaining exit stack.✦ The negative lambda behavior is the raw lambda table with top candidate assignment as its base, negative lambda continuation as its body action and lambda exit after negative frame payload decoding as its exit action.✦ Negative behavior packing chooses a negative observation representing a given table when one exists, and otherwise returns the default negative observation with top candidate assignment and absent exit.✦ The lambda observation value at a normalized active type is the typed value formed from its lambda action by the plain prefix or the corresponding signed free lambda construction.✦

Variable evaluation takes its observation value from the corresponding environment parameter, using the stored declaration and root conversion.✦ Sort evaluation gives the distinguished observation whenever its substituted expected type is active, and its candidate readout is the top normalization candidate.✦ Abstraction evaluation uses the body evaluations in every typed observation environment on the domain extension to form its abstraction action; its active value is the lambda observation value with that action, and its readout is the base candidate readout.✦ Application evaluation uses the function and argument evaluations, their stored typings and the conversion to the instantiated target; its active value is the application observation value and its readout is the base candidate readout.✦ The evaluated product candidate is the candidate at the normalized substituted product obtained from the domain readout and all matching payload-indexed body readouts through the product test.✦ Product evaluation takes its readout from the evaluated product candidate, and its product observation updates the coordinate of that exact product with this candidate.✦

Value goodness VG⁡t(ξ)\operatorname{VG}_t(\xi) and readout goodness RG⁡t(ξ)\operatorname{RG}_t(\xi) are respectively the value and readout conditions of recursive evaluation goodness on the stored tree under the raw substitution ξ\xi. At an abstraction, value goodness requires value goodness of the body at every typed argument with active instantiated target. A neutral term is a variable followed by zero or more applications.✦ At an application with active function type it requires value goodness of the function and, for an active domain, of the argument; with inactive function type it requires neutrality of the original application. For a product whose substituted profile belongs to CC, readout goodness requires readout goodness of the domain when its profile belongs to CC, and of each typed instantiated body when its profile belongs to CC. Its value condition requires these same conditions when both the product profile and its chosen result-sort singleton belong to CC.

A stored substitution 𝒔\mathbf s along a simultaneous substitution σ\sigma from Γ\Gamma to a valid Δ\Delta assigns each Γ(i)=A\Gamma(i)=A a tree sis_i for Δ⊢σi:A[σ]\Delta\vdash\sigma_i:A[\sigma].✦ Write t[σ;𝒔]t[\sigma;\mathbf s] for the substituted tree, and abbreviate it by t′t'. Substitution composition and extension use (5). (σ;ξ)i=σi[ξ],(a⋅ξ)0=a,(a⋅ξ)i+1=ξi.(\sigma;\xi)_i=\sigma_i[\xi],\qquad (a\cdot\xi)_0=a,\qquad(a\cdot\xi)_{i+1}=\xi_i.(5) For a raw actual substitution η\eta on Γ\Gamma, the activity guard Guard⁡(Γ,σ,η)\operatorname{Guard}(\Gamma,\sigma,\eta) is the declaration condition in (6). Guard⁡(Γ,σ,η)⇔for each Γ(i)=A with nonneutral σi,πΩ(A[η])∈ℒC⇒Act⁡(πΩ(A[η])).\operatorname{Guard}(\Gamma,\sigma,\eta)\quad\Longleftrightarrow\quad \begin{gathered} \text{for each }\Gamma(i)=A\text{ with nonneutral }\sigma_i,\\ \pi_\Omega(A[\eta])\in\mathcal L_C \ \Longrightarrow\ \operatorname{Act}(\pi_\Omega(A[\eta])). \end{gathered}(6)✦ Replacement goodness Good⁡(𝒔,ξ)\operatorname{Good}(\mathbf s,\xi) is the condition in (7) on the replacement trees at active declaration types. Good⁡(𝒔,ξ)⇔for each Γ(i)=A,Act⁡(πΩ(A[σ;ξ]))⇒VG⁡si(ξ).\operatorname{Good}(\mathbf s,\xi)\quad\Longleftrightarrow\quad \begin{gathered} \text{for each }\Gamma(i)=A,\\ \operatorname{Act}(\pi_\Omega(A[\sigma;\xi])) \ \Longrightarrow\ \operatorname{VG}_{s_i}(\xi). \end{gathered}(7)✦ Environments ee on Γ\Gamma and ff on Δ\Delta satisfy the assignment relation Assigned⁡𝒔(e,f)\operatorname{Assigned}_{\mathbf s}(e,f) when their raw substitutions and observation parameters obey (8); here ξe,pe\xi_e,p_e denote the two assignments of ee. ξe=σ;ξf,pe(i)=par⁡si(f)for each Γ(i)=A.\xi_e=\sigma;\xi_f,\qquad p_e(i)=\operatorname{par}_{s_i}(f) \quad\text{for each }\Gamma(i)=A.(8)✦ For a tree uu of Γ⊢n:D\Gamma\vdash n:D, let σn\sigma_n be the single substitution sending zero to nn and i+1i+1 to variable ii, and let 𝒔n\mathbf s_n be its stored substitution from D::ΓD::\Gamma to Γ\Gamma. The environment extension eue^u on D::ΓD::\Gamma sends zero to n[ξe]n[\xi_e] with parameter par⁡u(e)\operatorname{par}_u(e) and retains ee at successor indices.✦

A stored substitution from Γ\Gamma to Δ\Delta lifts from A::ΓA::\Gamma to A[σ]::ΔA[\sigma]::\Delta whenever Δ⊢A[σ]:s\Delta\vdash A[\sigma]:s for some sort ss, along the substitution that fixes the newest variable and shifts each older replacement into the extended context.✦

A declaration preserving renaming ρ\rho from Γ\Gamma to Δ\Delta is a map of indices such that every declaration Γ(i)=A\Gamma(i)=A gives the declaration Δ(ρ(i))=A[ρ]\Delta(\rho(i))=A[\rho], where A[ρ]A[\rho] denotes variable renaming.✦ For a declaration preserving renaming ρ\rho into a valid context Δ\Delta, renaming a stored tree for Γ⊢M:T\Gamma\vdash M:T gives a stored tree for Δ⊢M[ρ]:T[ρ]\Delta\vdash M[\rho]:T[\rho], preserving its shape and renaming its binder annotations.✦

The Claim

Theorem 1. Let tt be a stored tree for Γ⊢M:T\Gamma\vdash M:T, let Δ\Delta be valid, and let 𝒔\mathbf s be a stored substitution along σ\sigma from Γ\Gamma to Δ\Delta. Let ξ\xi be a tower typed substitution on Δ\Delta and set η=σ;ξ\eta=\sigma;\xi. Assume Guard⁡(Γ,σ,η)\operatorname{Guard}(\Gamma,\sigma,\eta) and Good⁡(𝒔,ξ)\operatorname{Good}(\mathbf s,\xi). When πΩ(T[η])\pi_\Omega(T[\eta]) is active and VG⁡t(η)\operatorname{VG}_t(\eta) holds, the first conclusion in (9) holds; when RG⁡t(η)\operatorname{RG}_t(\eta) holds, the second holds. VG⁡t′(ξ),RG⁡t′(ξ).\begin{aligned} \operatorname{VG}_{t'}(\xi),\\ \operatorname{RG}_{t'}(\xi). \end{aligned}(9)✦

Let e,fe,f be typed observation environments satisfying Assigned⁡𝒔(e,f)\operatorname{Assigned}_{\mathbf s}(e,f) and Guard⁡(Γ,σ,ξe)\operatorname{Guard}(\Gamma,\sigma,\xi_e). Under VG⁡t(ξe)\operatorname{VG}_t(\xi_e), when both substituted expected types have active profiles, the first equality in (10) holds; under RG⁡t(ξe)\operatorname{RG}_t(\xi_e), the second holds. |Val⁡t(e)|=|Val⁡t′(f)|,|Read⁡t(e)|=|Read⁡t′(f)|.\begin{aligned} |\operatorname{Val}_t(e)|&=|\operatorname{Val}_{t'}(f)|,\\ |\operatorname{Read}_t(e)|&=|\operatorname{Read}_{t'}(f)|. \end{aligned}(10)✦

For a single substitution σn\sigma_n and any raw substitution ξ\xi, suppose that πΩ(D[ξ])\pi_\Omega(D[\xi]) is active whenever it belongs to ℒC\mathcal L_C. Then the single substitution satisfies (11). Guard⁡(D::Γ,σn,n[ξ]⋅ξ).\operatorname{Guard}\bigl(D::\Gamma,\sigma_n,n[\xi]\cdot\xi\bigr).(11)✦

Let uu be a stored tree for Γ⊢n:D\Gamma\vdash n:D. Suppose VG⁡u(ξ)\operatorname{VG}_u(\xi) holds whenever πΩ(D[ξ])\pi_\Omega(D[\xi]) is active. Its stored single substitution then has the replacement goodness in (12). Good⁡(𝒔n,ξ).\operatorname{Good}(\mathbf s_n,\xi).(12)✦

For every typed observation environment ee on Γ\Gamma, its extension by uu satisfies the assignment law (13). Assigned⁡𝒔n(eu,e).\operatorname{Assigned}_{\mathbf s_n}(e^u,e).(13)✦

What Is Checked

The goodness laws are stated over stored typing substitutions and raw tower typed substitutions; the evaluation law also uses compatible observation environments and the exclusion of the forbidden configuration. Stored trees recover their typing judgments✦, and substitution by a tower typed substitution preserves the typings of both subjects and expected types.✦ Variable renaming preserves β\beta convertibility. Simultaneous substitution preserves β\beta convertibility. Whenever Γ⊢M:Πx:A.B\Gamma\vdash M:\Pi x:A.B, the product Πx:A.B\Pi x:A.B has some sort in Γ\Gamma.

The dependencies of plain observations on their actual domain parameters are well-founded, including domains encountered after finitely many continuing frames.✦ The optional evaluation parameter satisfies payload compatibility at the normalized substituted expected type.✦ A nonplain active target of an application key at a free type has the same free sign as its source.✦ Normalizing the substituted product of a product instance gives the product of its normalized substituted domain and body.✦

A declaration preserving renaming ρ\rho from Γ\Gamma to Δ\Delta lifts to one from A::ΓA::\Gamma to A[ρ]::ΔA[\rho]::\Delta, fixing zero and sending each successor index to the successor of its renamed index.✦

Every term typed at the normalized domain DeD_e of a product instance is also typed at its substituted domain before normalization.✦ For a product instance whose normalized product is an active type, substituting its application frame environment into its body and normalizing gives exactly the active target type of that frame’s application key.✦