def div_dbl
bend-collections-laws-math@1.0.0.0 · proofs/math/typed/f64sqc.bend:68
import bend-collections-laws-math@1.0.0.0/proofs/math/typed/f64sqc.bend as F64sqc
import Base
import bend-collections-laws-math@1.0.0.0/proofs/lib/logic.bend as L
import bend-collections-laws-math@1.0.0.0/proofs/math/natural/arith.bend as NR
68def div_dbl(+p: Nat) -> {Nat.div(Nat.add(p, p), 2n) == p : Nat}:
69 L.subst(Nat, z => {Nat.div(z, 2n) == p : Nat}, Nat.add(Nat.mul(p, 2n), 0n), Nat.add(p, p), two_add(p), NR.div_of(p, 1n, 0n, {==}))