[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
,
Theorem int2bytes-len-ls-03
⊦ 0 ≤ i ∧ int2bytes(i).first ≠ i2b(0) → (# int2bytes(i) < n ↔ i < 2 ^ ((n→i(n) - 1) * 8))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
int2bytes-len-le
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-le-01
int-abs
/
lels
int-abs
/
lels-01
int-abs
/
lels-04
nat
/
lels-01