ProofCore.four_lt_e: law of lawful-bytes@0.1.1.0
Import: import lawful-bytes@0.1.1.0/proof_core.bend as ProofCore
Lines 498-504 of lawful-bytes@0.1.1.0/proof_core.bend: https://jend.leeeet.dev/read.txt?path=lawful-bytes@0.1.1.0/proof_core.bend&start_line=498&end_line=504

import Base

# 4 * 2^d < 2^e for d + 2 < e (e stays a variable here: 2^32 must never be
# unfolded, so the callers instantiate e = 32n only in the final type).
law four_lt_e:
  for +d: Nat
  for +e: Nat
  for +he: {Nat.is_lt(Nat.add(2n, d), e) == True{} : Bool}
  {Nat.is_lt(Nat.mul(4n, Nat.pow(2n, d)), Nat.pow(2n, e)) == True{} : Bool}

Uses (9):
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Bool
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Equal.sym
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.add
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.is_lt
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.mul
  https://jend.leeeet.dev/definition.txt?path=Base/base.bend&name=Nat.pow
  https://jend.leeeet.dev/definition.txt?path=lawful-arrays@0.1.0.0/proof_base.bend&name=pow_lt
  https://jend.leeeet.dev/definition.txt?path=lawful-words@0.1.0.0/proof_nat.bend&name=mul_assoc