[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-crash
⊦ refsize-cons(gstore0, range fi) ∧ dom gstore0 ∪ elems nx = dom gstore ∪ ginval ∧ fi.lebs ⊆ dom gstore0 → refsize-cons(crash(gstore, gstore0, ginval, nx), range fi)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
gjournal-asm
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 8
Proof steps: 17
Used lemmas:
restrict-range-notin-lebs
,
Used spec theorems:
ablock-store-refsize-cons
/group-store/
refsize-cons-def
apersistence-base
/
crash-group-in
set-basic
/nat-set/
Extension
set-union
/nat-set/
unrax
Used simplifier rules:
apersistence-base
/
crash-group-at
ablock
/group-store/
elim
ablock-store-refsize-cons
/group-store/
size-emp
store
/group-store-ablock-store-nat-store/
notmemlookup
ablock
/group-store/
inj
set-basic
/nat-set/
size-zero-01
set-basic
/nat-set/
ne-01
set-union
/nat-set/
unc
set-union
/nat-set/
una
set-union
/nat-set/
unin-01
store+set
/group-store-ablock-store-nat-store/
Dom
apersistence-base
/
elems-def