[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 infapp-from-gt
⊦ # x < n → (x + nf).drop(n) = nf.drop(n - # x)
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:
get-from-inf
,
from-nf
,
add-list-fun-def
,
Used spec theorems:
Used simplifier rules:
nat
/
lels-03
nat
/
elim-sub
nat-basic
/
c
nat-basic
/
a
nat-basic
/
l-01
nat-basic
/
l-02
nat
/
eq-01