[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 pls-pos
0 < i, 0 < j, i ≤ i0, j < j0 ⊦ i * j < i0 * j0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
eq-one
,
ple-pos
,
pnle-pos
,
square-eq
,
square-ls
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 3
Used lemmas:
commutativity
,
associativity
,
ls-pos
,
Used spec theorems:
int-abs
/
forward-lels
Used simplifier rules:
int-abs
/
forward-le-05
int-basic1
/
trans
int-basic1
/
lf-01
int-abs
/
forward-le
int-basic1
/
forward-pos
int-abs
/
lels
int-abs
/
lels-03
int-abs
/
lenls