[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-pos
⊦ 1 < i0 ∧ 0 ≤ i ∧ 0 ≤ j → (i0 ^ i = i0 ^ j ↔ i = j)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
eq-one
,
eq-two
,
pot-add-min
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
eqone-01
,
Pot-zero
,
Pot-pos
,
Used spec theorems:
int-mult
/
eq-nonzero-01
Used simplifier rules:
int-abs
/
leone
int-basic1
/
elim-pred
int-abs
/
lels
int-abs
/
anti
int-mult
/
eq-one
int-abs
/
numadd-01
int-abs
/
lels-02
int-basic1
/
lf-03
int-basic1
/
lf-02
int-abs
/
abs
int-abs
/
numlsf-02
int-abs
/
numlef-01
int-abs
/
numle-02
int-abs
/
mone-06
int-abs
/
numls-02
int-basic2
/
add-in
int-basic2
/
succ-01
intnat
/
rax-04
int-basic2
/
add-a
int-basic2
/
add-c
nat-basic2
/
s
intnat
/
labs
int-abs
/
absle
int-basic1
/
irref
nat-basic2
/
a
nat-basic2
/
c
int-mult
/
Mult-zero
int-mult
/
associativity
int-mult
/
commutativity