[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 prefix-ex
⊦ ¬ x ⊑ y → (x ⊑ y + z ↔ (∃ x0. x = y + x0 ∧ x0 ⊑ z))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 9
Used lemmas:
prefix-app-01
,
prefix-rec-02
,
prefix-rec-01
,
prefix-empty
,
prefix-nil
,
postifx-app-03
,
Used spec theorems:
Used simplifier rules:
list
/
Nil
list
/
first-01
list
/
rest-01
list-data
/
elim-list-c
list
/
app-08
list
/
e-01
list
/
c
list
/
a
list
/
app-01