RecurrenceProof.ticks_length: def of bend-kit-scheduler@0.4.1.0
Import: import bend-kit-scheduler@0.4.1.0/recurrence_proof.bend as RecurrenceProof
Lines 18-26 of bend-kit-scheduler@0.4.1.0/recurrence_proof.bend: https://jend.leeeet.dev/read.txt?path=bend-kit-scheduler@0.4.1.0/recurrence_proof.bend&start_line=18&end_line=26

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

def ticks_length(count: Nat, +previous: Nat, +period: Nat)
  -> {List.length(&2, Nat, R.ticks(count, previous, period)) == count : Nat}:
  match count:
    case 0n:
      {==}
    case 1n+n:
      %ticks_length(n, Nat.add(previous, period), period) : {1n+List.length(&2, Nat,
        R.ticks(n, Nat.add(previous, period), period)) == 1n+_ : Nat}
      {==}

Uses (4):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.length
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=bend-kit-scheduler@0.4.1.0/recurrence.bend&name=ticks