[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 num-between
i + 1 = i0 ⊦ (* i) < j → (j ≤ (* i0) ↔ j = i0)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
bet
,
Used by units in proved state:
int-gcd
,
int-div
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
lels-03
,
succ-02
,
numle-01
,
le-def
,
Used spec theorems:
Used simplifier rules:
int-basic1
/
lst-01
int-basic1
/
irref
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero-rev