[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-01
⊦ i * j < j0 ∧ i0 ≤ i ∧ 0 ≤ j → i0 * j < j0
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-mult
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
ls-pos
,
commutativity
,
associativity
,
ls-forward
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lenls
int-abs
/
lels-02
int-abs
/
forward-lsle
int-abs
/
forward-le-01
int-abs
/
lels