[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 not-frag-empty
⊦ ¬ frag(IOAut(startf, stepf))([], α)
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
frag-move
,
infappend-moves
,
move-trans
,
not-exec-empty
,
shortest-frag
,
Used by units in proved state:
can-refines-traceprop
,
IOrefine-implies-HIObackward
,
restricted-refine-implies-forward
,
weakfin-startfin-IObackward-INV-is-leqrefine
,
IOrefine-implies-HIO-A-backward
,
equiv-F-nF-bF
,
IObackward-INV
,
can
,
beh
,
restricted-refine-implies-backward
,
infguess-forwardrefines-orig
,
restricted
,
IObackward
,
IOforward-is-leqrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
frag
,
Used spec theorems:
Used simplifier rules:
stream
/IOstatestream/
size-empty
nat-inf
/
sum-zero-fin
stream
/actionstream/
size-empty-equiv
nat-inf
/
add-assoc
nat-inf
/
add-comm