[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 btree-restrict-union-proper
n < # asar ⊦ ((btree(rp, r, adr, height, dirty, ri, iast | union(asar, 0, # asar), asar[n], alladrs, nstat) * P))(zh) ↔ ((btree(rp, r, adr, height, dirty, ri, iast | asar[n], asar[n], alladrs, nstat) * P))(zh)
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: 4
Proof steps: 8
Used lemmas:
btree-istore-reduce-refed
,
btree-adrs
,
btree-refed-subseteq-alladrs
,
btree-istore-restrict
,
btree-istore-restrict-to-as
,
Used spec theorems:
store
/index-store-address-store/
Subset
store+set
/index-store-address-store/
restrict-at
Used simplifier rules:
nat-basic
/
f
heap-sep
/zheap/
sep-com
heap-sep
/zheap/
sep-ass
set-basic
/node-store/
size-zero-01
store+set
/index-store-address-store/
Dom
set-basic
/node-store/
ne-01
set-basic
/node-store/
sub-in
store+set
/index-store-address-store/
restrict-at
store+set
/index-store-address-store/
restrict-in
address-set-array-ops
/
in-index-in-union