[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 prepost-split-nodes
ndx1 = ndx ⊦ ⟪gjournal_split_nodes#(n; ndx, ndx0)⟫ (ndx1 = ndx0 + ndx ∧ ndx0.flashsize ≤ n ∧ (ndx = [] ∨ ndx0.flashsize + ndx.head.flashsize > n))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
inv-gc-copy
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 8
Used lemmas:
split-nodes
,
Used spec theorems:
Used simplifier rules:
nat
/
lep
nat
/
gr-def
nat-basic
/
l
nat
/
lels
list
/node-list/
Nil
gjournal-base
/
flashsize-nodes-base
nat-basic
/
add-base
nat
/
ge
nat
/
le-def
nat
/
le-ls-simp
list
/node-list/
Last
list
/node-list/
fr
list
/node-list/
a
list
/node-list/
app-01
gjournal-base
/
flashsize-app
gjournal-base
/
flashsize-one
nat
/
sub-add
nat-basic
/
a
nat-basic
/
c
nat-basic
/
eq-01
list-data
/node-list/
length-rest
nat
/
pred-03
nat-basic
/
one-01
list-data
/node-list/
l
nat
/
ls-01
nat-basic
/
s-04
oelem
/nat-set/
irreflexivity