def size_pair.go

lawful-arrays@0.1.0.0 · PROOF.bend:56

import Base
import lawful-arrays@0.1.0.0/defs.bend as D
import lawful-arrays@0.1.0.0/proof_tree.bend as P

56def size_pair.go(-T: Data, -a: Array<T>, +d: Nat, hf: {D.full(T, a, d) == True{} : Bool},
57  m: P.Mirror(T, a)) -> {Array.size(T, a) == (a, U32.shln(1, d)) : Array<T> & U32}:
58  (t, +e) = m
59  %e : {Array.size(T, _) == (_, U32.shln(1, d)) : Array<T> & U32}
60  P.size_tree(T, d, t, full_t(T, a, t, d, e, hf))