[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 save-properties (conclusion)
⊦ save(znd) = indexnode(brar, bv, n) → (bv ↔ znd.leaf) ∧ n = znd.usedsize
System applied rule normalize
And obtained the following new goals
Proof step 2
:
save(znd) = indexnode(brar, bv, n) ⊦ (bv ↔ znd.leaf) ∧ n = znd.usedsize
Rule argument
Additional information