[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 adrlist-append-eq-size
# lax0 = # lax2 + 1 ⊦ lax0 + lax1 = lax2 + ladr ' ↔ ¬ ¬(lax1 = [] ∧ lax0 = lax2 + ladr ')
Type: A user defined theorem
Validity: The proof is valid.
Features: s, ls,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 1
Proof steps: 2
Used lemmas:
Used spec theorems:
list-del
/laddress-list/
extension
Used simplifier rules:
list
/laddress-list/
ni
list
/laddress-list/
in-append
list
/laddress-list/
in-15
list
/laddress-list/
app-01
list
/laddress-list/
app
list
/laddress-list/
len
list
/laddress-list/
a
list
/laddress-list/
len-02
nat-basic
/
eq-02
list-data
/laddress-list/
l
nat-basic
/
a
nat-basic
/
c