def sqn_t

bend-collections-laws-math@1.0.0.0 · proofs/math/typed/f64sqc.bend:160

import Base
import bend-collections-laws-math@1.0.0.0/src/math/f64.bend as F
import bend-collections-laws-math@1.0.0.0/src/math/w64.bend as X
import bend-collections-laws-math@1.0.0.0/src/math/u64.bend as WU

160# sq_n on a known parity, unfolded once over variables (the four cases of
161# sqn_c rewrite with these instead of unfolding the square root each time)
162def sqn_t(+e: Nat, +m: WU.U64) -> {F.sq_n(e, m, True{}) == F.sq_root(Nat.add(Nat.div(Nat.sub(Nat.add(e, F.off()), 1075n), 2n), 1048n), X.shl(m, 8n)) : F.F64}:
163  {==}