[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 INV-nextlevel
⊦ INV(∅, N, V, n, source) → (¬ INV(N, ∅, V, n + 1, source) ↔ false)
Type: A user defined theorem
Validity: The proof is valid.
Features: simp, localsimp,
Comment:
Used by:
Used by units in proved state:
BFS
,
Proof exists?: Yes
View
the proof
Infos about the proof
Proved?: Yes
Interactions: 21
Proof steps: 46
Used lemmas:
INV-def
,
Used spec theorems:
graph
/
reach-succ
graph
/
reachls-def
Used simplifier rules:
nat
/
le-ls-simp
nat
/
l-num-01
nat
/
lels
graph
/
reachless-succ
set-basic
/
size-zero-01
set-basic
/
ne-01
nat-basic1
/
ref-1
nat
/
lep-02
nat-basic2
/
oz
nat-basic1
/
lf-01
nat
/
eqle-one
nat-basic2
/
between
nat-basic2
/
s
nat
/
add-num-03
nat-basic1
/
f
graph
/
reachless-next
graph
/
reachless-succ-edge
set-basic
/
In-empty
graph
/
reachset-emptyset
nat-basic2
/
a
graph
/
reach-succ
graph
/
reachset-one
set-union
/
One
nat-basic2
/
c