law fin_fst
import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTreeimport Base
98law fin_fst:
99 for -T: Type
100 for r: Array<T> & T
101 {Array.set.fin(T, r) == Pair.fst(Array<T>, T, r) : Array<T>}
import lawful-arrays@0.1.0.0/proof_tree.bend as ProofTreeimport Base
98law fin_fst:
99 for -T: Type
100 for r: Array<T> & T
101 {Array.set.fin(T, r) == Pair.fst(Array<T>, T, r) : Array<T>}