theorem proved term proof

`tick_rate_bounded`

No prose has been written for this declaration yet. The Lean source and graph data below render without it.

formal statement (Lean)

 124theorem tick_rate_bounded : fundamental_tick > 0 := tick_pos

proof body

Term-mode proof.

 125
 126/-- **THEOREM IC-003.9**: Any RS computation taking n steps requires at least n ticks.
 127    Time(n steps) ≥ n × τ₀ (by discreteness of time in RS). -/

used by (1)

From the project-wide theorem graph. These declarations reference this one in their body.

ic003_certificate in IndisputableMonolith.Information.ChurchTuringPhysicsStructure decl_use

depends on (8)

Lean names referenced from this declaration's body.

of in IndisputableMonolith.Astrophysics.NucleosynthesisTiers decl_use
Time in IndisputableMonolith.Constants.RSNativeUnits decl_use
of in IndisputableMonolith.Foundation.DAlembert.LedgerFactorization decl_use
of in IndisputableMonolith.Foundation.PhiForcingDerived decl_use
of in IndisputableMonolith.Foundation.SpectralEmergence decl_use
fundamental_tick in IndisputableMonolith.Information.ComputationLimitsStructure decl_use
tick_pos in IndisputableMonolith.Information.ComputationLimitsStructure decl_use
of in IndisputableMonolith.Information.PhysicsComplexityStructure decl_use