[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 cast-if
⊦ 0 < i → cast(i, j) = (0 ≤ j ∧ j % 2 ^ i ≤ 2 ^ (i - 1) - 1 ⊃ j % 2 ^ i ;(0 ≤ j ∧ 2 ^ (i - 1) - 1 < j % 2 ^ i ⊃ j % 2 ^ i - 2 ^ i ;(j < 0 ∧ j % 2 ^ i < ~(2 ^ (i - 1)) ⊃ j % 2 ^ i + 2 ^ i;(j < 0 ∧ ~(2 ^ (i - 1)) ≤ j % 2 ^ i ⊃ j % 2 ^ i;j)) ) )
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
byte
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 16
Used lemmas:
cast-size-fits-01
,
cast-mod-neg-high
,
cast-mod-neg-low
,
cast-mod-pos-high
,
cast-mod-pos-low
,
Used spec theorems:
Used simplifier rules:
int-abs
/
forward-lels
int-basic2
/
ls
int-pot
/
two-lsz
int-abs
/
forward-lsle
int-abs
/
zero-gels-04
int-abs
/
forward-le-02
int-abs
/
zero-gels-01
int-abs
/
Sub-def
int-abs
/
sub-eq
int-abs
/
lels-04
int-abs
/
lels-03
int-abs
/
forward-le-01
int-abs
/
forward-le-05
int-abs
/
negle-13
int-abs
/
neg-07
int-abs
/
succ-02
int-abs
/
sub-ls
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
lels
int-abs
/
succ-01
int-abs
/
sub-le-01
int-abs
/
lels-01