[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 ri-closed
⊦ ri-closed(ri, fs, ro) ↔ (∀ key. key ∈ ri → ri[key] ∈ fs ∧ node-closed(fs[ri[key]], ri, fs, ro))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
datanode-pagesize
,
ri-closed-drop
,
ri-closed-gc-one
,
ri-closed-variant1-01
,
ubifs-cons-log-cons
,
ubifs-cons-logadr-in
,
ubifs-cons-ri-closed
,
ubifs-cons-ri-inj
,
ubifs-file-in
,
ubifs-file-notdir
,
ubifs-fo-subset
,
ubifs-in-fs
,
ubifs-log-nodups-add1
,
ubifs-log-nodups-add2
,
ubifs-log-nodups-add3
,
ubifs-log-nodups-add4
,
ubifs-log-nodups-add5
,
ubifs-parent-dir
,
ubifs-parent-in
,
ubifs-ri-cons
,
ubifs-ro-subset
,
Used by units in proved state:
Proof exists?: No