[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 range-eq-cut (conclusion)
⊦ n1 + m ≤ # ar1 → (range=(ar0, n0, ar1, n1, m) ↔ range=(ar0, n0, resize(ar1, n1 + m), n1, m))
System applied rule normalize
And obtained the following new goals
Proof step 2
:
n1 + m ≤ # ar1 ⊦ range=(ar0, n0, ar1, n1, m) ↔ range=(ar0, n0, resize(ar1, n1 + m), n1, m)
Rule argument
Additional information