PROOF.size_pair.go: def of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/PROOF.bend as PROOF
Lines 56-60 of lawful-arrays@0.1.0.0/PROOF.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/PROOF.bend&start_line=56&end_line=60

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

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

Uses (12):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.size
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Pair
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Sigma
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=U32.shln
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/PROOF.bend&name=full_t
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/defs.bend&name=full
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Mirror
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=size_tree