[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 diffgetn-nodupssize
⊦ ¬ dups(x) ∧ n < # x → #(x \ x[n] ') = # x - 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: 15
Used lemmas:
diff-e
,
diff-n
,
diff-onenonmember
,
diff-y
,
Used spec theorems:
list-del
/
get-append-grt
Used simplifier rules:
list-data
/
l
nat-basic
/
f
nat
/
elim-pred-c
nat
/
lels
nat-basic
/
c
nat-basic
/
a
nat-basic
/
s-04
nat-basic
/
oz
list
/
a
list-dup
/
rec
list
/
c
list
/
e-01
nat-basic
/
eq-01
nat-basic
/
succ
list
/
len-05
list
/
in-17
list
/
app
nat
/
lez-01
list-dup
/
e-01
list
/
in-empty
list-data
/
size-nil
list-del
/
one-03
list-del
/
get-append-less
list
/
len-02
nat-basic
/
one-01
nat
/
succ-01
nat
/
ls-02
nat
/
le-def
nat
/
eq-02