LAWS.view_inj: law of lawful-arrays@0.1.0.0
Import: import lawful-arrays@0.1.0.0/LAWS.bend as LAWS
Lines 159-168 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=159&end_line=168

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

# Two perfect trees of the same depth with the same leaves are the same array.
law view_inj:
  for -T: Data
  for a: Array<T>
  for b: Array<T>
  for d: Nat
  for ha: {D.full(T, a, d) == True{} : Bool}
  for hb: {D.full(T, b, d) == True{} : Bool}
  for h: {D.view(T, a) == D.view(T, b) : List<&2, T>}
  {a == b : Array<T>}

Uses (8):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Array
  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=Nat
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/PROOF.bend&name=view_inj.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=view
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_tree.bend&name=mirror