[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 longin-mult-01
⊦ i ∈bint ∧ j ∈bint → (i * j)∈long
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
longin-mult
,
longin-mult-mod
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 27
Used lemmas:
inlong
,
inbint
,
Used spec theorems:
int-abs
/
forward-lels
int-mult
/
ple-pos-better
int-abs
/
Abs-neg
int-abs
/
ls-rew-succ
Used simplifier rules:
int-basic1
/
lst
int-abs
/
forward-lels
int-div
/
nummult-ls-01
int-mult
/
numlsneg-03
int-abs
/
anti
int-abs
/
numle-03
int-abs
/
neg-13
int-abs
/
numls-03
int-abs
/
neg-07
int-abs
/
abs-06
int-abs
/
neg
int-mult
/
zero-gr
int-abs
/
lels-04
int-abs
/
abs-03
int-abs
/
abs-16
int-mult
/
zero-gr-02
int-abs
/
Abs-pos
int-mult
/
zero-gr-01
int-abs
/
abs-08
int-abs
/
neg-06
int-mult
/
minus-left
int-abs
/
neg-02
int-basic1
/
numlslsdel-01
int-abs
/
lels-02
int-mult
/
zero-ls-02
int-abs
/
lels
int-abs
/
numleledel
int-abs
/
numlelsdel
int-mult
/
numlsneg-02
int-abs
/
minus-add
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
sub-ls-01
int-div
/
nummult-ls-02
int-abs
/
forward-lsle
int-basic1
/
forward-pos
int-mult
/
le-pos
int-abs
/
numleledel-01
int-abs
/
forward-le-02
int-abs
/
forward-le-05
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
zero-ls-01
int-abs
/
zero-gels-03
int-basic1
/
numlsf
int-abs
/
lels-01
int-abs
/
forward-lele