[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 square-one-le
⊦ i * i ≤ 1 ↔ i = 0 ∨ i = 1 ∨ i = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
int-square
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 4
Used lemmas:
commutativity
,
associativity
,
square-le
,
Used spec theorems:
Used simplifier rules:
int-abs
/
lels-01
int-basic1
/
forward-pos
int-abs
/
forward-le-05
int-abs
/
numleledel
int-abs
/
abs-one-01