LAWS.get_set_other: law of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/LAWS.bend as LAWS
Lines 108-119 of lawful-arrays@0.1.0.0/LAWS.bend: https://jend.leeeet.dev/read.txt?path=lawful-arrays@0.1.0.0/LAWS.bend&start_line=108&end_line=119

import Base
import lawful-arrays@0.1.0.0/defs.bend as D

# Writing leaf i does not change leaf j (j a different leaf modulo the size).
law get_set_other:
  for -T: Data
  for a: Array<T>
  for d: Nat
  for i: U32
  for j: U32
  for v: T
  for hf: {D.full(T, a, d) == True{} : Bool}
  for hd: {Nat.is_lt(d, 32n) == True{} : Bool}
  for hij: {Nat.is_eq(D.slot(i, d), D.slot(j, d)) == False{} : Bool}
  {Pair.snd(Array<T>, T, Array.get(T, Array.set(T, a, i, v), j)) == Pair.snd(Array<T>, T, Array.get(T, a, j)) : T}

Uses (13):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array.get
  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=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_eq
  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=Pair.snd
  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=get_set_other.go
  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/proof_tree.bend&name=mirror