[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 abs-keys-orphans-add (conclusion)
⊦ ro.inodes? → (abs-keys(ro) = abs-keys(orphans(fs, ri)) ++ n ↔ ro = orphans(fs, ri) ++ inodekey(n))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
ro.inodes? ⊦ abs-keys(ro) = abs-keys(orphans(fs, ri)) ++ n ↔ ro = orphans(fs, ri) ++ inodekey(n)
Rule argument
Additional information