[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 inapp-02
⊦ ¬ a ∈ y → (y + a0 ' + z = a ' + z0 ↔ y = [] ∧ a0 = a ∧ z = z0)
Type: A user defined theorem
Validity: The proof is valid.
Features: ws, lws,
Comment:
Used by:
inapp
,
inapp-03
,
isin-01
,
two
,
Used by units in proved state:
wolist
,
olist
,
list-dup
,
list-del
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 0
Proof steps: 3
Used lemmas:
in-rec
,
c
,
in-empty
,
c-06
,
a
,
app-07
,
Nil
,
Used spec theorems:
Used simplifier rules: