RecurrenceLaws.future_deadline: law of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/recurrence_laws.bend as RecurrenceLaws
Lines 46-52 of bend-kit-scheduler@0.4.1.0/recurrence_laws.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-scheduler@0.4.1.0/recurrence_laws.bend&start_line=46&end_line=52

import Base
import bend-kit-scheduler@0.4.1.0/recurrence.bend as R

# Every positive planner branch returns a deadline strictly beyond completion.
law future_deadline:
  for +previous: Nat
  for +completion: Nat
  for +p: Nat
  for cadence: R.Cadence
  {Nat.is_lt(completion, R.next(R.positive(cadence, previous, completion, 1n+p))) == True{} : Bool}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=Cadence
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=next
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=positive
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence_proof.bend&name=fixed_rate_future
  https://jend.leeeet.dev/definition.txt?path=bend-mathlib@0.8.1.0/nat.bend&name=le_total
  https://jend.leeeet.dev/definition.txt?path=bend-mathlib@0.8.1.0/nat.bend&name=lt_add_of_pos_right