[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-step
⊦ INV(C, N, V, n, source) ∧ v ∈ C → (¬ INV(C -- v, N ∪ (succ(v) \ V), V ∪ succ(v), n, 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: 13
Proof steps: 36
Used lemmas:
INV-def
,
Used spec theorems:
graph
/
reachset-def
Used simplifier rules:
set-union
/
Difference
graph
/
reachset-mem-reach
graph
/
reachless-edge
set-union
/
unc
set-union
/
una
set-union
/
Union
set-basic
/
size-zero-01
set-basic
/
ne-01
graph
/
reachset-del
nat-basic2
/
c
nat-basic2
/
a
graph
/
reach-succ
set-union
/
del-rax
graph
/
reachset-one
set-union
/
One