[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 numlsf-01
⊦ (* i) < j ∧ 0 < i → 0 ≤ j ∧ 0 < j
Type: A user defined theorem
Validity: The proof is valid.
Features: localforward,
Comment:
Used by:
le-three
,
sub-less
,
zero-not
,
Used by units in proved state:
int-div
,
int-square
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
le-def
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lst
int-basic1
/
ls-01