PROOF.set_view.go: def of lawful-arrays@0.1.0.0 Import: import lawful-arrays@0.1.0.0/PROOF.bend as PROOF Lines 103-108 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=103&end_line=108 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 def set_view.go(-T: Data, -a: Array, +d: Nat, +i: U32, +v: T, hf: {D.full(T, a, d) == True{} : Bool}, +hd: {Nat.is_lt(d, 32n) == True{} : Bool}, m: P.Mirror(T, a)) -> {D.view(T, Array.set(T, a, i, v)) == List.set(&2, T, D.view(T, a), D.slot(i, d), v) : List<&2, T>}: (t, +e) = m %e : {D.view(T, Array.set(T, _, i, v)) == List.set(&2, T, D.view(T, _), D.slot(i, d), v) : List<&2, T>} I.set_view_t(T, t, d, i, v, full_t(T, a, t, d, e, hf), hd) Uses (15): https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.set https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=List.set https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_lt 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=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/defs.bend&name=slot https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/defs.bend&name=view https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_index.bend&name=set_view_t https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=Mirror