law tg2
lawful-bytes@0.1.1.0 · proof_fast_append.bend:85
import lawful-bytes@0.1.1.0/proof_fast_append.bend as ProofFastAppend
import Base
85law tg2:
86 for +ys: List<&2, U32>
87 for +m: Nat
88 for +b0: U32
89 for +b1: U32
90 for +hm: {Nat.is_le(m, 2n) == True{} : Bool}
91 for g0: {Nat.is_lt(0n, m) == True{} : Bool} -> {List.get(&2, U32, ys, 0n) == Some{b0} : Maybe<&2, U32>}
92 for g1: {Nat.is_lt(1n, m) == True{} : Bool} -> {List.get(&2, U32, ys, 1n) == Some{b1} : Maybe<&2, U32>}
93 {List.take(&2, U32, ys, m) == List.take(&2, U32, [b0, b1], m) : List<&2, U32>}