def le_trans
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
97def le_trans(-A: Data, a: Q.Ticket<A>, b: Q.Ticket<A>, c: Q.Ticket<A>, e: {Q.le(A, a, b) == True{} : Bool}, f: {Q.le(A, b, c) == True{} : Bool}) -> {Q.le(A, a, c) == True{} : Bool}:
98 match a b c:
99 case Q.Ticket{i, d, x} Q.Ticket{j, g, y} Q.Ticket{k, h, z}:
100 key_trans(d, g, h, i, j, k, e, f)