[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 remtau-append
⊦ (⌜al⌝ + α2)^ = ⌜al⌝ ^ + α2 ^
Type: A user defined theorem
Validity: The proof is valid.
Features: ls, s,
Comment:
Used by:
not-lessto-inf
,
remtau-append-fin
,
remtau-empty-equiv
,
remtau-fin-append
,
remtau-from-strong
,
remtau-nontau-01
,
remtau-nottau-1
,
remtau-strong-to
,
remtau-tofin-strong
,
Used by units in proved state:
can-refines-traceprop
,
IOrefine-implies-HIObackward
,
restricted-refine-implies-forward
,
IOrefine-implies-HIO-A-backward
,
equiv-F-nF-bF
,
IObackward-INV
,
beh
,
restricted-refine-implies-backward
,
IOtrace
,
IOrefine-def
,
restricted
,
IObackward
,
IOforward-is-leqrefine
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 18
Used lemmas:
remtau-tau-lem
,
remtau-nontau-lem
,
remtau-empty
,
Used spec theorems:
Used simplifier rules:
stream
/actionstream/
empty
stream
/actionstream/
empty-append
stream
/actionstream/
append-assoc
list
/actionstream/
a
stream
/actionstream/
append-finfin
list
/actionstream/
c
stream
/actionstream/
append-cancel-l