[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 log-cons-copy-new
# kx = # ax ⊦ kx.toSet ⊆ dom ri ∧ ri-cons(ri, fs) ∧ ¬ dups(kx) ∧ ¬ dups(ax) → log-cons(ax, fs[ax, fs[ri[kx]]])
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
aubifs-internal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 17
Used lemmas:
key-cons
,
key-node-cons
,
log-cons
,
ri-cons
,
Used spec theorems:
list
/address-list-set/
in-def
list
/key-list-set/
split-first
aubifs-base
/
at-write-other
Used simplifier rules:
aubifs-base
/
in-write
list-dup
/address-list-set/
a
list-dup
/address-list-set/
f-01
list
/address-list-set/
len
nat
/
le-def
nat-basic
/
f
nat-basic
/
lf-02
nat-basic
/
l-02
aubifs-base
/
write-app
list
/address-list-set/
len-05
aubifs-base
/
read-app
aubifs-base
/
index-lookup-app
set-union
/node-index/
unsub-union-01
list
/key-list-set/
len
list-data
/key-list-set/
size-01
nat-basic
/
z-01
list-data
/address-list-set/
l
list-dup
/key-list-set/
a
list-dup
/key-list-set/
c-02
list-dup
/key-list-set/
f-01
list
/node-list/
a
aubifs-base
/
write-rec
list
/address-list-set/
a
list
/node-list/
c
aubifs-base
/
read-rec
list
/address-list-set/
c
aubifs-base
/
index-lookup-rec
store+set
/node-index/
Dom
set-basic
/node-index/
sub-add-03
set-union
/node-index/
unc
set-union
/node-index/
una
set-union
/node-index/
une
set-union
/node-index/
unadd
list+set
/key-list-set/
toSet-one
list+set
/key-list-set/
toSet-app
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
list
/key-list-set/
a
nat-basic
/
succ
list
/key-list-set/
len-05
list
/key-list-set/
c
store
/node-store/
At-same
aubifs-base
/
index-lookup-length
aubifs-base
/
read-length