[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-law-add-pos
⊦ 0 ≤ j ∧ 0 ≤ j0 ∧ 0 < i → cast(i, j + j0) = cast(i, cast(i, j) + j0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cast-law-add-one
,
cast-law-add-pos-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 14
Proof steps: 21
Used lemmas:
cast-add-2pot
,
cast-mult-pos
,
cast-mod-pos-low
,
cast-mod-pos-high
,
Used spec theorems:
int-basic2
/
add-c
Used simplifier rules:
int-abs
/
elim-sub
int-pot
/
pot2-ls-pred
int-abs
/
sub-add-01
int-abs
/
zero-gs
int-abs
/
anti
int-mult
/
one
int-abs
/
leone
int-abs
/
forward-lels
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
zero-gels-04
int-mult
/
zero-ge-add
int-pot
/
pot2-pos
int-basic1
/
ls-01
int-div
/
div-elim-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