law get_view_t

lawful-arrays@0.1.0.0 · proof_index.bend:458

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

458law get_view_t:
459  for -T: Data
460  for +t: P.Tree<T>
461  for +d: Nat
462  for +i: U32
463  for +hf: {D.full(T, P.fromT(T, t), d) == True{} : Bool}
464  for +hd: {Nat.is_lt(d, 32n) == True{} : Bool}
465  {Some{Pair.snd(Array<T>, T, Array.get(T, P.fromT(T, t), i))}
466    == List.get(&2, T, D.view(T, P.fromT(T, t)), D.slot(i, d)) : Maybe<&2, T>}