[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 numls-07
⊦ (* i1) * j < j ↔ 0 < (1 - i1) * j
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
int-pot
,
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 5
Used lemmas:
zero-gr
,
ls-same-02
,
zero-ls-03
,
commutativity
,
associativity
,
zero-gr-03
,
ls-same-04
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lsone
int-abs
/
sub-ls-01
int-abs
/
zero-gels-04
int-abs
/
forward-le-04
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero-rev
int-abs
/
sub-ls
int-abs
/
lels
int-abs
/
lels-02
int-abs
/
numlelsdel-01
int-abs
/
forward-lsle