[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-mult-pos
⊦ 0 ≤ j ∧ 0 ≤ j0 ∧ 0 < i → cast(i, j * 2 ^ i + j0) = cast(i, j0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
cast-law-add-pos
,
cast-law-mult-pos
,
cast-mult-add
,
cast-mult-add-h-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 12
Used lemmas:
cast-mod-pos-low
,
cast-mod-pos-high
,
Used spec theorems:
Used simplifier rules:
int-abs
/
Sub-def
int-abs
/
sub-eq
int-pot
/
two-lsz
int-mult
/
zero-ls-02
int-basic2
/
ls
int-abs
/
forward-le-02
int-abs
/
forward-lsle
int-mult
/
commutativity
int-mult
/
associativity
int-pot
/
mod-add1-pospos
int-abs
/
sub-le-01
int-abs
/
succ-01
int-abs
/
lels-03
int-abs
/
lels
int-basic2
/
add-c
int-basic2
/
add-a
int-abs
/
succ-02
int-abs
/
sub-ls
int-abs
/
lels-04
int-abs
/
lels-01
int-abs
/
forward-le-01
int-abs
/
forward-le-05