[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 referenced-adrs-lookup-keys-nodups
⊦ ri-cons(ri, fs) ∧ ¬ dups(ax) → ¬ dups(fs[referenced-adrs(ax, ri)].keys)
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 21
Used lemmas:
referenced-adrs-split-one
,
referenced-adrs-in
,
referenced-adrs-split
,
keys-eq-one
,
keys-split
,
keys-one
,
keys-app
,
referenced-adrs-rec
,
keys-base-01
,
referenced-adrs-base
,
Used spec theorems:
list
/key-list-set/
in-def
aubifs-base
/
read-split
store+set
/node-index/
Data-in
Used simplifier rules:
list-dup
/key-list-set/
e-01
list-dup
/address-list-set/
dups-cons
list
/address-list-set/
c
aubifs-base
/
read-base
list
/key-list-set/
Nil
list-dup
/key-list-set/
dups-cons
list
/node-list/
in-rec
list
/key-list-set/
c
list
/node-list/
in-14
list
/node-list/
in-17
list-dup
/key-list-set/
d
list-dup
/key-list-set/
c
list-dup
/key-list-set/
c-03
list-dup
/key-list-set/
f
aubifs-base
/
read-one
list
/node-list/
a
list
/node-list/
in-append
aubifs-base
/
read-app
aubifs-base
/
read-eq-one
list
/address-list-set/
in-14
list
/address-list-set/
in-rec
list-dup
/address-list-set/
f-01
list
/key-list-set/
a
list-dup
/key-list-set/
a
list-dup
/address-list-set/
a
list
/address-list-set/
in-13
list
/address-list-set/
a
list
/address-list-set/
in-append
aubifs-inv
/
ri-cons-key