[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 hpal-next
finout(g) ⊦ ∀ x. x ≠ [] ∧ pathp(g)(⌜x⌝ ) ∧ haspathanylength(g)(x.last) → (∃ y. (∃ b. y = x + b ') ∧ pathp(g)(⌜y⌝ ) ∧ haspathanylength(g)(y.last))
Type: A user defined theorem
Validity: The proof is valid.
Features:
Comment:
Used by:
KoenigsLemma
,
Used by units in proved state:
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 17
Proof steps: 33
Used lemmas:
haspathanylength-def
,
hpal-next-aux
,
finout-def
,
Used spec theorems:
infgraph-gen
/
pathp-def
list-del
/
get-append-grt
list-del
/
get-append-less
list-del
/
get-last-nonempty
Used simplifier rules:
set-basic
/
size-zero-01
set-basic
/
ne-01
list
/
a
list-last
/
last-def
stream
/
append-finfin
list
/
c-04
list
/
len-01
stream
/
sel-fin
nat-inf
/
less-fin
stream
/
size-fin
nat-inf
/
add-comm
nat-inf
/
add-assoc
nat-inf
/
ls-natinf-to-nat-2-1
nat-basic
/
c
nat-basic
/
a
nat-inf
/
add-fin
stream
/
append-assoc
stream
/
get-append2-fin
list-del
/
get-butlast
nat-inf
/
add-all-zero
nat-inf
/
add-ls-cancel-num-04
list
/
len-02
stream
/
size-append
nat-inf
/
less-succ-leq
nat
/
lels
list
/
app
list
/
c
list-data
/
lf-01
list
/
e
list-data
/
elim-list-c
list
/
c-03
list-del
/
one-03
nat-basic
/
one-01
nat-basic
/
less-zero
nat-inf
/
add-ls-cancel-num-03
nat
/
anti
nat
/
ler
nat
/
zero
nat
/
lels-03
list-data
/
l
nat-basic
/
f
nat-basic
/
refl-Nat
nat-basic
/
s-04
nat-basic
/
l
nat
/
les
nat-basic
/
oz
nat-basic
/
lf-01
nat
/
eqle-one
list-del
/
get-last
nat-basic
/
zero
nat
/
add-01
nat-basic
/
add-base