[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 l
⊦ ¬ i < j ↔ ¬ ¬(i = j ∨ j < i)
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp,
Comment:
Used by:
forward-any-lsle
,
forward-pos
,
k-lsrec
,
lf
,
lf-01
,
lf-02
,
lf-03
,
lf-04
,
lf-05
,
lf-06
,
lf-07
,
lf-08
,
ls-02
,
ls-rec
,
ls-succ-04
,
lst
,
num-ls-rec
,
numlsf
,
numlslsdel
,
numlslsdel-01
,
trans-lem
,
trans-succ
,
Used by units in proved state:
int-gcd
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
lst-02
,
ls-01
,
Used spec theorems:
Used simplifier rules: