[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
,
Proof step 1 from proof data-notin-other1 (conclusion)
⊦ ubifs-cons(fs, ri, ro, fi, fo, log) ∧ ¬ adr0 ∈ fs ∧ adr0 ≠ adr1 → ¬ adr0 ∈ ri[key1, adr1]
System applied rule normalize
And obtained the following new goals
Proof step 2
:
ubifs-cons(fs, ri, ro, fi, fo, log), adr0 ∈ ri[key1, adr1] ⊦ adr0 = adr1, adr0 ∈ fs
Rule argument
Additional information