[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 to-adrs-sublist
n0 + n1 ≤ # lax ⊦ sublist(n0, n1, lax.to-adr(n)) = sublist(n0, n1, lax).to-adr(n)
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: 6
Proof steps: 19
Used lemmas:
addresslist-length
,
adrs-rec
,
adrs-empty
,
Used spec theorems:
list-del
/address-list-set/
sublist-append-02
list-del
/laddress-list/
sublist-append-02
list-del
/address-list-set/
sublist-append-01-01
list-del
/laddress-list/
sublist-append-01-01
Used simplifier rules:
list-data
/laddress-list/
size-01
nat
/
lez-01
nat-basic
/
z-01
list
/laddress-list/
len-05
list
/laddress-list/
c
laddress
/
elim
nat-basic
/
one-01
list-del
/address-list-set/
sub-zerozero
list-del
/laddress-list/
sub-zerozero
nat
/
let
nat
/
not-zero
nat
/
elim-pred-c
nat-basic
/
oz
nat
/
le-def
nat-basic
/
nls-fst
list
/address-list-set/
a
list
/address-list-set/
app-08
list
/laddress-list/
a
list
/address-list-set/
c
laddress
/
sel-01
laddress
/
sel-02
nat
/
lep-02
nat-basic
/
succ
list
/address-list-set/
len-02
nat
/
lep
nat
/
le-sum
nat-basic
/
c
nat-basic
/
a
nat-basic
/
add-base
nat
/
add-01
list
/laddress-list/
len-02