[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-of-two
⊦ a ≠ b ∧ x ⊑ y + a ' + z1 ∧ x ⊑ y + b ' + z2 → x ⊑ y
Type: A user defined theorem
Validity: The proof is valid.
Features: forward,
Comment:
Used by:
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:
prefix-empty
,
prefix
,
Used spec theorems:
Used simplifier rules:
list
/
in-append0-not-left
list
/
a
list
/
in-append
list
/
in-14
list
/
Nil
list
/
c
list
/
c-06
list
/
in-empty
list
/
in-rec
list
/
len-01