[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 two
⊦ a ' + b ' = x + a0 ' + c ' + y ↔ x = [] ∧ y = [] ∧ a = a0 ∧ b = c
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 8
Used lemmas:
e-02
,
in-11
,
c-03
,
inapp-02
,
e-01
,
c
,
c-05
,
app-06
,
in-16
,
in-rec
,
in-append
,
in-15
,
in-14
,
app-08
,
a
,
app
,
Nil
,
Used spec theorems:
Used simplifier rules: