[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 leone-two
⊦ i / 2 ≤ 1 ↔ i ≤ 1 + 1 + 1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 10
Used lemmas:
div-elim-pos
,
lstwozero
,
Used spec theorems:
int-mult
/
modlep-03
Used simplifier rules:
int-abs
/
zero-gels-03
int-abs
/
forward-le-02
int-abs
/
lels
int-abs
/
zero-gels-04
int-abs
/
forward-le-01
int-mult
/
zero-ge-add
int-mult
/
one
int-mult
/
numls-12
int-abs
/
leone
int-abs
/
numls-02
int-basic2
/
num-between
int-abs
/
absle
int-abs
/
numlelsdel
int-basic1
/
ls-01
int-abs
/
forward-le-05
int-basic1
/
forward-pos
int-abs
/
lels-01
int-abs
/
bet
int-mult
/
one-01
int-mult
/
associativity
int-mult
/
commutativity
int-abs
/
numle-03
int-basic2
/
add-a
int-basic2
/
add-c
int-abs
/
numlsledel
int-abs
/
forward-lels
int-basic1
/
lf-02
int-abs
/
numleledel