[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 12 from proof of-cons-reduce (
previous step
)
of0[n] = mkfile(m, mode, m0), of1[n] = mkfile(m1, mode0, m2), n ∈ of1, n ∈ of0 → m ∈ files0, ∀ n. n ∈ of1 → of1[n].ino ∈ files1, ∀ n. n ∈ of0 → of0[n].ino ∈ files0 ⊦ m1 ∈ files1
User applied rule all left
And closed the goal!
Rule argument
pos: left 5 terms: n abort: F discard: T computed: T
Additional information
Used simplifier rules: ⊦ mkfile(m, mode, m0).ino = m; (s) Used terms: n