Conditional order induced by a lift
ProvedWindingDynamics.inducedClockOrderA lifted real reading induces an irreflexive transitive relation. Injectivity makes it total on distinct events, strict monotonicity makes it agree with a supplied linear order, and an explicit one-turn sample shows that net winding alone does not imply monotonicity.
import Definitions.Def_WindingDynamics_NeutralClockCoreV1
theorem WindingDynamics.inducedClockOrder :
WindingDynamics.InducedClockOrderGate := by sorryRead-back
What the Lean code literally says, in plain math · gpt-5.6-sol
For every small type and every reading , define to mean exactly . The theorem asserts the conjunction that: for every , no event precedes itself and, for every , together with implies ; for every , if is injective, then every distinct satisfy or ; for every equipped with a LinearOrder and every strictly monotone for that order, for every ; and there exists at least one reading such that , , , , and is not strictly monotone for the canonical order on . No nonemptiness hypothesis is imposed in the universal clauses, so they also cover the empty event type vacuously; the existential clause specifies existence but not uniqueness of the reading.