[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 ls-even-01
⊦ i % 2 = 0 ∧ j % 2 = 0 → (i / 2 < j / 2 ↔ i < j)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 30
Used lemmas:
div-elim
,
div-elim-negpos
,
lstwozero
,
div-ls-zero
,
two-even
,
divmult
,
num-ls
,
neg-01
,
mod-neg-01
,
ls-even
,
Used spec theorems:
int-abs
/
le-def
int-abs
/
lels
Used simplifier rules:
int-abs
/
zero-gels-01
int-abs
/
neg-07
int-mult
/
commutativity
int-mult
/
associativity
int-mult
/
minus-left
int-basic2
/
add-c
int-basic2
/
add-a
int-basic2
/
add-zero
int-abs
/
negle-07
int-abs
/
neg-10
int-abs
/
forward-le-02
int-abs
/
neg-13
int-abs
/
zero-gels-03
int-abs
/
neg-01
int-abs
/
forward-lels
int-abs
/
le-def
int-basic1
/
ls-01
int-abs
/
lels
int-abs
/
anti
int-abs
/
lels-03
int-abs
/
forward-le-05
int-abs
/
forward-le-04
int-abs
/
forward-lele
int-abs
/
forward-le-01
int-abs
/
forward-lsle
int-abs
/
numle-03
int-basic2
/
ls
int-abs
/
zero-gels-04
int-abs
/
lep-01
int-basic1
/
forward-pos
int-basic1
/
irref
int-mult
/
ls-two-03
int-mult
/
zero-ls
int-mult
/
zero-gr