law min_top
import lawful-bytes@0.1.1.0/proof_fast_find.bend as ProofFastFindimport Base
443law min_top:
444 for +to: U32
445 for +d: Nat
446 for +hd: {Nat.is_le(d, 29n) == True{} : Bool}
447 for +ht: {Nat.is_le(U32.to_nat(to), Nat.mul(4n, Nat.pow(2n, d))) == True{} : Bool}
448 {U32.min(4294967295, to) == to : U32}