def cons_le

bend-collections-laws-crypto@1.0.0.0 · proofs/crypto/poly1305/value.bend:40

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

40def cons_le(+x: U32, +t: List<&2, U32>, +b: Nat, +hx: {Nat.is_le(v(x), b) == True{} : Bool}, +ht: {le_all(t, b) == True{} : Bool}) -> {le_all(x <> t, b) == True{} : Bool}:
41  L.and_intro(Nat.is_le(v(x), b), le_all(t, b), hx, ht)