def gcd_all_dvd

bend-collections-laws-crypto@1.0.0.0 · proofs/math/natural/lists.bend:91

import Base
import bend-collections-laws-crypto@1.0.0.0/src/math/natural.bend as M

91# gcd_all(xs) divides every element: xs[i] == k gcd_all(xs) (0 past the end)   (Mathlib Finset.gcd_dvd)
92def gcd_all_dvd(+xs: List<&2, Nat>, +i: Nat) -> {nth0(xs, i, 0n) == Nat.mul(gw_nth(xs, 0n, i), M.gcd_all(xs)) : Nat}:
93  g_nth(xs, 0n, i)