[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 F-inj
⊦ mkfile(m0, md0, n0, content0) = mkfile(m1, md1, n1, content1) ↔ ¬(n0 ≠ n1 ∨ md0 ≠ md1 ∨ m0 ≠ m1 ∨ content0 ≠ content1)
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
abs-files-del-data
,
abs-files-del-dentry
,
abs-files-del-dir
,
abs-files-del-file
,
abs-files-del-orphans
,
abs-files-drop
,
abs-files-evict
,
abs-files-gc-copy
,
abs-files-orphans
,
abs-files-trunc
,
abs-files-unused-adrs
,
Used by units in proved state:
aubifs-refine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 1
Used lemmas:
Used spec theorems:
Used simplifier rules:
abstract-file
/
inj