def size_count.go

lawful-arrays@0.1.0.0 · PROOF.bend:41

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
import lawful-arrays@0.1.0.0/proof_index.bend as I

41def size_count.go(-T: Data, -a: Array<T>, +d: Nat, hf: {D.full(T, a, d) == True{} : Bool},
42  +hd: {Nat.is_lt(d, 32n) == True{} : Bool}, m: P.Mirror(T, a)) ->
43  {U32.to_nat(Pair.snd(Array<T>, U32, Array.size(T, a))) == Nat.pow(2n, d) : Nat}:
44  (t, +e) = m
45  %e : {U32.to_nat(Pair.snd(Array<T>, U32, Array.size(T, _))) == Nat.pow(2n, d) : Nat}
46  I.size_count_t(T, t, d, full_t(T, a, t, d, e, hf), hd)