[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 path-nodups-subset
⊦ path(x, H) ∧ ¬ dups(x) → # x ≤ # H
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
cyclic-weak-def
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 10
Used lemmas:
Used spec theorems:
store
/linheap/
size
path-reachable
/
path-delnonmember
Used simplifier rules:
list
/reflist/
in-06
path-reachable
/
path-cons
path-reachable
/
path-empty
nat
/
le-ls-simp
nat
/
ls-01
nat-basic1
/
one-01
store
/linheap/
empty-01
store
/linheap/
Size-empty
nat
/
lez
nat
/
pred-03
path-reachable
/
path-first-in-H
list
/reflist/
app
path-reachable
/
path-one
list-data
/reflist/
size-01
nat
/
lez-01
store
/linheap/
empty
list-dup
/reflist/
e-01
list
/reflist/
in-empty
store
/linheap/
In-empty
nat
/
lels
list-dup
/reflist/
dups-cons
nat-basic2
/
c
nat-basic2
/
a
nat-basic2
/
s
list
/reflist/
len-02
list
/reflist/
len
list
/reflist/
a
list
/reflist/
e-01
list
/reflist/
c
list-data
/reflist/
l
nat-basic1
/
f
nat
/
lels-01