[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 append-assoc
⊦ (σ + σ1) + σ2 = σ + σ1 + σ2
Type: A user defined theorem
Validity: The proof is valid.
Features: localsimp, simp,
Comment:
Used by:
append-cancel-l
,
append-cancel-l-02
,
append-cancel-r-01
,
append-cancel-r-02
,
append-cancel-r-04
,
append-cut1
,
append-empty
,
append-empty-01
,
append-eq-inf
,
append-extract-list
,
append-extract-list-2
,
append-from-addsize-01
,
append-from-ge-01
,
append-from-ge-02
,
append-from-gr-01
,
append-from-gr-02
,
append-from-le-01
,
append-notsmallersize1
,
append-notsmallersize2
,
append-split
,
append-to-addsize-01
,
append-to-gr-01
,
append-to-le-01
,
append-to-ls
,
append-toinf-ls
,
appendend-equal
,
cons-append
,
cons-empty
,
cons-eq
,
cons-eq-inf
,
cons-from-addnum
,
cons-from-num
,
cons-to-addnum
,
cons-to-num
,
constrrew
,
contractinf-from1
,
contractinf-tl
,
elim-fromto
,
elim-hd-tl
,
empty-leq
,
eq-stream-to-list-2-1
,
eq-stream-to-list-3-1
,
fin-neq-inf
,
finp-append-01
,
finp-append-02
,
from-append-add
,
from-append-tofrom
,
from-append-toinffrom
,
from-succ
,
from-succ-cons
,
from-to-exchange
,
get-append-ls
,
get-append-notls
,
get-cons-num
,
get-cons-succ
,
get-cons-zero
,
hd-lem
,
hd-one
,
leq-append-both
,
leq-append-left
,
leq-empty
,
leq-prefix
,
leq-refl
,
leq-symm-2
,
leq-trans
,
neq-fin-inf-01
,
neq-fin-inf-02
,
neq-fin-inf-03
,
one-inf
,
size-append
,
stream-empty
,
swap-to-from-app
,
tl-fin-1
,
tl-lem
,
tl-one
,
to-append-add
,
to-attach
,
to-plus-from
,
to-plus-from-inf
,
to-succ-cons
,
to-unwind-begin
,
to-unwind-end
,
toinfto-append-add
,
toinftoinf-append-add
,
toone-cons
,
toone-one
,
Used by units in proved state:
stut-mon
,
mon-lim-filter-count
,
streamseq-mon-lim
,
infinite-append
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 10
Proof steps: 19
Used lemmas:
append-inf
,
append-fininf
,
eq-stream-to-list-3-3
,
append-finfin
,
Used spec theorems:
Used simplifier rules:
nat
/
ls-01
nat
/
lels-01
list
/
len
list-del
/
get-append-grt
list
/
a
list-del
/
get-append-less
nat-basic2
/
l-02
list-data
/
l
nat-basic1
/
f
nat
/
fle-01
nat
/
lels
nat
/
eq-01
nat-basic2
/
a
nat-basic2
/
c
nat
/
elim-sub
stream-basic
/
inj-01