[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 refsize-cons-append
⊦ st[n] = mkblock(x, lax, m) ∧ n ∈ st ∧ ¬ @(m0, m1) ∈ lax ∧ refsize-cons(st, as) ∧ as ⊆ dom nodes(st) → refsize-cons(st[n, mkblock(x + a ', lax + @(m0, m1) ', m + m1)], as ++ @(n, m0, m1))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
restrict-add-other
,
restrict-in
,
size-rec
,
restrict-add
,
refsize-cons-def
,
Used spec theorems:
store
/ablock-store-nat-store/
At-other
Used simplifier rules:
ablock
/
elim
list
/
in-17
list
/
in-append
list
/laddress-list/
in-17
list
/laddress-list/
in-append
list
/
a
list
/
in-15
list
/laddress-list/
a
list
/laddress-list/
in-15
store
/ablock-store-nat-store/
insin
ablock
/
inj
store
/ablock-store-nat-store/
At-same
set-basic
/address-store/
eq
set-basic
/address-store/
sub-in
set-basic
/address-store/
ne-01
store+set
/address-store/
Dom
ablock-nodes
/
in-nodes
ablock-store-inv
/
in-adr-in
nat-basic
/
c
nat-basic
/
a
nat-basic
/
eq-01
address-data
/
sel-05
ablock
/
sel-03
store
/ablock-store-nat-store/
in-neq