[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 range-last-2
⊦ n + 1 < # zbrar → key-range(zbrar, n + 1, n + 2, ri) = ri |> zbrar[n].key
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: 3
Used lemmas:
range-last
,
Used spec theorems:
Used simplifier rules:
nat-basic
/
f
nat-basic
/
oz
nat-basic
/
a
nat-basic
/
c
nat
/
add-01
nat-basic
/
add-base