[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-toset-inter-restr-empty
⊦ ¬ n ∈ nx → abs-log(nx, gstore).toSet ∩ (as | n) = ∅
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
in-restr-eq-notin-log
,
Used by units in proved state:
gjournal-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 3
Proof steps: 9
Used lemmas:
abs-log-rec
,
abs-log-base
,
Used spec theorems:
set-basic
/node-store/
Extension
Used simplifier rules:
list+set
/address-list-set/
toSet-empty
set-union
/node-store/
int-e
list
/nat-list-set/
in-06
list
/address-list-set/
a
list+set
/address-list-set/
toSet-app
list
/nat-list-set/
a
list
/nat-list-set/
c
ablock
/group-store/
elim
set-union
/node-store/
unc
set-union
/node-store/
una
set-union
/node-store/
intu-empty
set-basic
/node-store/
size-zero-01
set-basic
/node-store/
size-zero
set-basic
/node-store/
ne-01
ablock-store-refsize-cons
/group-store/
restrict-leb
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
address-data
/
elim