[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-files-drop
⊦ ¬ adr ∈ ri → abs-files(fs[adr, nd], ri) = abs-files(fs, ri)
Type: A user defined theorem
Validity: The proof is valid.
Features: s,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 9
Used lemmas:
at-content
,
in-content
,
P-ext
,
F-inj
,
file
,
at-files
,
in-files
,
F-ext
,
Used spec theorems:
Used simplifier rules:
store
/node-store/
At-same
store+set
/node-index/
In-data-in
store
/node-store/
At-other