def get_view.go

lawful-arrays@0.1.0.0 · PROOF.bend:68

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

68def get_view.go(-T: Data, -a: Array<T>, +d: Nat, +i: U32, hf: {D.full(T, a, d) == True{} : Bool},
69  +hd: {Nat.is_lt(d, 32n) == True{} : Bool}, m: P.Mirror(T, a)) ->
70  {Some{Pair.snd(Array<T>, T, Array.get(T, a, i))} == List.get(&2, T, D.view(T, a), D.slot(i, d)) : Maybe<&2, T>}:
71  (t, +e) = m
72  %e : {Some{Pair.snd(Array<T>, T, Array.get(T, _, i))} == List.get(&2, T, D.view(T, _), D.slot(i, d)) : Maybe<&2, T>}
73  I.get_view_t(T, t, d, i, full_t(T, a, t, d, e, hf), hd)