law hi_snd
import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTreeimport Base
88law hi_snd:
89 for -T: Type
90 for -xs: Array<T>
91 for r: Array<T> & T
92 {Pair.snd(Array<T>, T, Array.swap.hi(T, xs, r)) == Pair.snd(Array<T>, T, r) : T}
import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTreeimport Base
88law hi_snd:
89 for -T: Type
90 for -xs: Array<T>
91 for r: Array<T> & T
92 {Pair.snd(Array<T>, T, Array.swap.hi(T, xs, r)) == Pair.snd(Array<T>, T, r) : T}