[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 log-cons
⊦ log-cons(log, fs) ↔ (∀ adr. adr ∈ log → adr ∈ fs ∧ node-cons(fs[adr].key, fs[adr]))
Type: An axiom
Validity: The proof is valid.
Features: ls,
Comment:
Used by:
datanode-pagesize
,
log-adr-in
,
log-cons-app
,
log-cons-copy-new
,
log-cons-copy-old
,
log-cons-drop
,
log-cons-emp
,
log-cons-one
,
log-cons-variant1-01
,
log-node-cons
,
nodups-new-nodups
,
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