def gcd_all_divides

bend-collections-laws-math@1.0.0.0 · proofs/math/natural/proof.bend:65

import Base
import bend-collections-laws-math@1.0.0.0/spec/math/natural.bend as S
import bend-collections-laws-math@1.0.0.0/proofs/math/natural/lists.bend as LS

65def gcd_all_divides(+xs: List<&2, Nat>, +i: Nat) -> S.GcdAll.divides(xs, i):
66  (LS.gw_nth(xs, 0n, i), LS.gcd_all_dvd(xs, i))