def scal_len_ge

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/curve25519/poly.bend:230

import Base
import bend-collections-laws-crypto@1.0.0.0/src/crypto/curve25519/field.bend as F
import bend-collections-laws-crypto@1.0.0.0/proofs/lib/logic.bend as L

230def scal_len_ge(+n: Nat, +x: U32, +ys: List<&2, U32>, +e: {len_ge(n, ys) == True{} : Bool}) -> {len_ge(n, F.scal(x, ys)) == True{} : Bool}:
231  match n ys:
232    case 0n _:
233      {==}
234    case 1n+m Nil{}:
235      Empty.absurd({len_ge(1n+m, Nil{}) == True{} : Bool}, L.false_true(e))
236    case 1n+ +m Con{y, +yt}:
237      scal_len_ge(m, x, yt, e)