def pos_ge_one

bend-collections-laws-crypto@1.0.0.0 · proofs/math/typed/u32.bend:123

import Base

123# 0 < n gives not n < 1
124def pos_ge_one(+n: Nat, +h: {Nat.is_lt(0n, n) == True{} : Bool}) -> {Nat.is_lt(n, 1n) == False{} : Bool}:
125  match n:
126    case 0n:
127      Empty.absurd({Nat.is_lt(0n, 1n) == False{} : Bool}, true_ne_false(Equal.sym(Bool, False{}, True{}, h)))
128    case 1n+p:
129      lt_zero_false(p)