def one_le

bend-collections-laws-math@1.0.0.0 · proofs/math/typed/f64sqv.bend:32

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

32def one_le(+one: Nat, +h1: {one == 1n : Nat}) -> {Nat.is_le(1n, one) == True{} : Bool}:
33  L.subst(Nat, z => {Nat.is_le(1n, z) == True{} : Bool}, 1n, one, Equal.sym(Nat, one, 1n, h1), {==})