[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 diffone-nodupsget
⊦ n + 1 < # x ∧ ¬ dups(x) ∧ a ∈ x → (x \ a ')[n] = (n < pos(a, x) ⊃ x[n];x[n + 1])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 19
Used lemmas:
diff-n
,
diff-y
,
diff-onenonmember
,
diff-firstofapp
,
Used spec theorems:
list-del
/
get-append-grt
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
list
/
a
list-del
/
pos-n
list-del
/
get-nodups
nat-basic
/
less-zero
list-del
/
pos-y
list-dup
/
rec
list
/
c
nat-basic
/
l
nat-basic
/
succ
list
/
len-05
list
/
in-rec
list-del
/
get-succ
list
/
e-01
list
/
in-17
list-del
/
inl
nat-basic
/
trans-nat
nat-basic
/
lf
list-del
/
get-append-less
list
/
len-02
nat-basic
/
one-01
list-del
/
get-zero-01
nat-basic
/
zero
nat
/
elim-pred-c
nat
/
lels
nat-basic
/
oz
nat
/
le-ls-simp
list-del
/
get-append-grt
nat
/
succ-01