[Imprint]
[Data Privacy Statement]
[E-Mail]
View
long theorem info
. View
the proof
. Back to
main index
. View
the specification
. View
theorem base summary
, View
theorem base listing
, the
used properties by spec
, the
dependency list
, the
symbol table
,
Proof step 4 from proof byte-nle (
previous step
)
~128 ≤ b2i(by) ∧ b2i(by) ≤ 127, 256 ≤ abs(b2i(by)) ⊦ b2i(by) = 0
Heuristic simplifier applied rule simplifier
And obtained the following new goals
Proof step 5
:
~128 ≤ b2i(by), 256 ≤ abs(b2i(by)) ⊦ b2i(by) = 0
Rule argument
Additional information
Used simplifier rules: byte-le: ⊦ b2i(by) ≤ 127;