~/jendhub

def gpos

bend-collections-laws-math@1.0.0.0 · proofs/math/typed/u64int.bend:238

import bend-collections-laws-math@1.0.0.0/proofs/math/typed/u64int.bend as U64int
import Base
import bend-collections-laws-math@1.0.0.0/src/math/natural.bend as M
import bend-collections-laws-math@1.0.0.0/proofs/math/natural/proof.bend as NP

238# gcd of a positive number is positive
239def gpos(+ap: Nat, +b: Nat) -> {Nat.is_eq(M.gcd(1n+ap, b), 0n) == False{} : Bool}:
240  gpos_d(ap, b, NP.divides_left(1n+ap, b), M.gcd(1n+ap, b), {==})

Uses (6)

Used by (1)