[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 eqpos
⊦ pos(char1, str) < # str → (pos(char1, str) = pos(char2, str) ↔ char1 = char2)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
val-total-01
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 8
Used lemmas:
Used spec theorems:
list-del
/string-new/
pos-n
Used simplifier rules:
nat
/
lels
nat-basic2
/
s
nat-basic2
/
succ
list
/string-new/
len-05
list
/string-new/
e-01
list
/string-new/
c
list-del
/string-new/
pos-n
string-less-new
/
len-zero
nat-basic1
/
f
nat
/
eqle-one
nat
/
succ-01
list-del
/string-new/
pos-y
list
/string-new/
a
nat-basic2
/
z-01
nat-basic1
/
lf-02
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
eq-01