[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 INVR-nextlevel
⊦ INVR(∅, N, V, n, n0, source, dest) ∧ INV(∅, N, V, n, source) → (¬ INVR(N, ∅, V, n + 1, n0, source, dest) ↔ 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: 0
Proof steps: 6
Used lemmas:
INV-def
,
INVR-def
,
Used spec theorems:
Used simplifier rules:
nat-basic2
/
oz
nat
/
elim-pred-c
nat
/
cancel-01
nat-basic2
/
l-01
set-basic
/
size-zero-01
nat-basic1
/
f
set-basic
/
ne-01
nat
/
ls-le-simp
nat
/
lels-03
graph
/
reach-succ
graph
/
reachset-emptyset
set-basic
/
In-empty
graph
/
reachset-one
set-union
/
One
nat-basic2
/
c
nat-basic2
/
a
nat
/
lels
nat
/
succ-01
nat
/
lels-01
nat-basic1
/
ls-02
nat
/
elim-sub