[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 lr-03
⊦ x ≠ [] ∧ y ≠ [] → (# x.rest = # y.rest ↔ # x = # y)
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: 2
Used lemmas:
l
,
length-rest
,
Used spec theorems:
Used simplifier rules:
nat
/
pred-03
nat
/
lels-01
nat-basic1
/
one-01
nat
/
eq-02
nat-basic2
/
c
nat-basic2
/
a
nat
/
add-01
nat-basic2
/
add-base
nat
/
elim-pred-c