[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-init
⊦ reach(source, dest, n0) ∧ ¬ reach<(source, dest, n0) → (¬ INVR(∅ ++ source, ∅, ∅ ++ source, 0, 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: 1
Used lemmas:
INVR-def
,
Used spec theorems:
Used simplifier rules:
graph
/
reachset-one
nat
/
ax-10
set-union
/
One
set-basic
/
in-04
nat
/
lez