[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(start, step, ext))(σ, α) → (# α < # σ ↔ finp(α))
Type: A user defined theorem
Validity: The proof is valid.
Features: ss, lss,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 4
Used lemmas:
frag
,
Used spec theorems:
Used simplifier rules:
stream-basic
/
elim-finp-suc
stream
/
size-inf
nat-inf
/
less-inf1
stream
/
size-fin
stream-basic
/
elim-finp-ant
nat-inf
/
add-assoc
nat-inf
/
add-comm
nat-inf
/
inf-inseq-reduce
nat-basic
/
s-04
nat-basic
/
refl-Nat
nat-basic
/
a
nat-basic
/
c