[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 div-one-one-neg
⊦ i | ~1 ↔ i = 1 ∨ i = ~1
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
div-one-neg-pos
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 5
Used lemmas:
divides-mone
,
div-one
,
divides
,
Used spec theorems:
int-abs
/
Abs-neg
Used simplifier rules:
int-mult
/
commutativity
int-mult
/
associativity
int-abs
/
abs-neg
int-mult
/
eq-one-neg
int-abs
/
neg-06
int-abs
/
negeq
int-abs
/
numadd-01
int-basic2
/
add-a
int-basic2
/
add-c
int-basic1
/
lf-02
int-abs
/
forward-le-02
int-abs
/
minus-add
int-abs
/
sub-eq
int-abs
/
Abs-pos
int-abs
/
lels
int-abs
/
forward-le-01