[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 frag-size-2
⊦ frag(IOAut(startf, stepf))(σ, α) → (# α < # σ ↔ finp(α))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
trace-append
,
Used by units in proved state:
restricted-refine-implies-forward
,
beh
,
IObackward-INV-is-leqstarrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 3
Used lemmas:
frag
,
Used spec theorems:
Used simplifier rules:
stream
/actionstream/
size-fin
stream-basic
/actionstream/
test-02
stream-basic
/actionstream/
stream-fin-forward
nat-inf
/
less-inf1
stream
/actionstream/
notfin-sizeinf
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
inf-inseq-reduce
nat-basic
/
s-04
nat-basic
/
ref
nat-basic
/
a
nat-basic
/
c