[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 app-06
⊦ x + a ' = y + a0 ' ↔ x = y ∧ a = a0
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
app-03
,
eq
,
eq-02
,
eq-03
,
in-16
,
inapp-12
,
inapp-13
,
inapp-14
,
inex
,
isin-01
,
neq-03
,
neq-06
,
neq-07
,
ni
,
two
,
Used by units in proved state:
stream
,
path-reachable
,
list-last
,
list-dup
,
infinite-append-old
,
infinite-append
,
filter-count
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 2
Proof steps: 7
Used lemmas:
c-06
,
e-02
,
c-03
,
c
,
a
,
c-05
,
Nil
,
Used spec theorems:
Used simplifier rules: