[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 isprefix-size
⊦ lax0 ⊑ lax2 + lax ∧ # lax = # gndx → ¬ # lax2 + # gndx < # lax0
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: 2
Proof steps: 5
Used lemmas:
Used spec theorems:
list-last
/laddress-list/
prefix
list-del
/laddress-list/
extension
Used simplifier rules:
list-data
/laddress-list/
l
nat-basic
/
f
list
/laddress-list/
len
list
/laddress-list/
a
nat-basic
/
lf-02
nat-basic
/
l-02
nat-basic
/
a
nat-basic
/
c