[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 betweenlels-zero-one
⊦ 0.r ≤ i.r → (i.r < 1.r ↔ i = 0)
Type: A user defined theorem
Validity: The proof is valid.
Features: as, las,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 2
Used lemmas:
le-num
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-03
real-basic
/
ls-num
int-abs
/
lels-02
int-abs
/
lsone