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