[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 postfix-split-stronger
x ⊒ y + z, ¬ x ⊒ z ⊦ ∃ x0. x0 + z = x ∧ x0 ⊒ y
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
postfix-split
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 5
Proof steps: 11
Used lemmas:
butlast-last
,
postfix-app-02
,
lin-01
,
blapp
,
lb
,
bapp
,
lapp
,
postfix-empty-03
,
postfix-empty
,
postfix-rec
,
Used spec theorems:
Used simplifier rules:
list
/
app-02
list
/
Nil
list
/
a
list
/
app
list
/
in-15
list
/
in-append
list
/
app-03
nat-basic
/
c
nat-basic
/
a
nat-basic
/
refl-nat
nat-basic
/
s-04
nat
/
ls-01
list-data
/
l
nat-basic
/
one-01
nat
/
le-def