[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 abs-log-new
⊦ new(ax, nodes(gstore, ginval)) ∧ elems nx ⊆ dom gstore ∧ elems nx ∩ ginval = ∅ → ax.toSet ∩ abs-log(nx, gstore).toSet = ∅
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 13
Used lemmas:
nodes-gstore-in
,
abs-log-rec
,
abs-log-base
,
Used spec theorems:
set-basic
/node-store/
Extension
aubifs-base
/
new-ext
Used simplifier rules:
apersistence-base
/
elems-empty
set-union
/nat-set/
int-e
list+set
/address-list-set/
toSet-empty
set-union
/node-store/
int-e
store+set
/group-store-ablock-store-nat-store/
Dom
set-basic
/nat-set/
sub-add-03
list
/address-list-set/
a
list+set
/address-list-set/
toSet-app
set-union
/nat-set/
int-a
set-union
/nat-set/
int-ins
list
/nat-list-set/
a
apersistence-base
/
elems-prepend
list
/nat-list-set/
c
ablock
/group-store/
elim
set-basic
/node-store/
size-zero
set-basic
/node-store/
size-zero-01
set-union
/node-store/
unc
set-union
/node-store/
una
set-union
/node-store/
intu-empty
set-union
/nat-set/
int-c
set-union
/node-store/
int-c
set-union
/node-store/
int-a
list+set
/address-list-set/
toSet-ext
set-union
/node-store/
Intersect
set-basic
/node-store/
In-empty
ablock-store-inv
/group-store/
to-adrs-in
ablock-store-inv
/group-store/
in-in-adr
address-data
/
elim