[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 prefixn-append-prefix
⊦ x0 ⊑ prefixn(n, x0 + x1) ↔ n ≥ # x0
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 4
Proof steps: 10
Used lemmas:
prefixn
,
Used spec theorems:
list-last
/
prefix
list
/
append-size-less
Used simplifier rules:
nat
/
ge
list
/
app-01
nat-basic2
/
l-02
nat-basic1
/
lf
nat-basic1
/
f
nat-basic1
/
trans-1
nat-basic2
/
succ
nat
/
lels-01
nat
/
le-ls-simp
list-del
/
elim-firstn-restn
nat
/
let
list
/
len
list
/
a
nat-basic2
/
l-01
list-data
/
l
nat-basic2
/
a
nat-basic2
/
c
nat
/
lep
nat
/
lep-02
list-last
/
prefix-app-05
nat
/
lels
nat
/
anti
list
/
len-01
list-last
/
prefix-size-eq