def le_refl
import bend-kit-scheduler@0.4.1.0/queue_proof.bend as QueueProofimport Base
import bend-kit-scheduler@0.4.1.0/queue.bend as Q
87def le_refl(-A: Data, t: Q.Ticket<A>) -> {Q.le(A, t, t) == True{} : Bool}:
88 match t:
89 case Q.Ticket{i, d, x}:
90 key_refl(d, i)