law set_view_t
lawful-arrays@0.1.0.0 · proof_index.bend:520
import lawful-arrays@0.1.0.0/proof_index.bend as ProofIndex
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
520law set_view_t:
521 for -T: Data
522 for +t: P.Tree<T>
523 for +d: Nat
524 for +i: U32
525 for +v: T
526 for +hf: {D.full(T, P.fromT(T, t), d) == True{} : Bool}
527 for +hd: {Nat.is_lt(d, 32n) == True{} : Bool}
528 {D.view(T, Array.set(T, P.fromT(T, t), i, v))
529 == List.set(&2, T, D.view(T, P.fromT(T, t)), D.slot(i, d), v) : List<&2, T>}