[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
,
Theorem Sep-split
⊦ m0 ≤ m → nP ⊗_(n, m) = nP ⊗_(n, m0) * nP ⊗_(n + m0, m - m0)
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Sep-unfold
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 6
Proof steps: 10
Used lemmas:
Sep-rec
,
Sep-base
,
Used spec theorems:
nat-basic
/
c
Used simplifier rules:
nat
/
elim-sub
nat-basic
/
c
nat-basic
/
a
nat
/
lep
nat-basic
/
add-base
heap-sep
/
emp-sep
heap-sep
/
sep-ass
heap-sep
/
sep-com
nat-basic
/
succ