isConsistent
plain-language theorem explainer
A state x is RRF-consistent under a strain ledger SL precisely when its strain component satisfies the balance predicate and its ledger component satisfies the closure predicate. Researchers building RRF state spaces or consciousness models cite this definition to enforce the joint low-strain and conservation requirement. The definition is realized as a direct conjunction of the two imported predicates with no further reduction.
Claim. Let $SL$ be a strain ledger over a state space of type $State$. A state $x$ is consistent if the strain component of $SL$ is balanced at $x$ and the ledger component of $SL$ is closed at $x$.
background
The RRF Core Glossary fixes canonical vocabulary for the Reality Recognition Framework. Strain measures deviation from balance via the J-cost functional, while the ledger records double-entry conservation constraints. A StrainLedger packages one strain functional and one ledger constraint for any chosen state type, ensuring uniform terminology across modules.
proof idea
The definition is a direct conjunction of two predicates: the balance condition drawn from the strain component and the closure condition drawn from the ledger component. No lemmas or tactics are invoked; the body simply assembles the two atomic properties already defined in the strain and ledger substructures.
why it matters
This supplies the core consistency predicate collected by consistentStates in the same module and reused by isConsistent and validMoves in RRF.Foundation.Consciousness. It anchors the requirement that strain tends to zero while ledgers remain closed, aligning with the Recognition Composition Law and the J-uniqueness step in the T0-T8 forcing chain.
Switch to Lean above to see the machine-checked source, dependencies, and usage graph.