[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
,
Proof step 21 from proof eval-nonexisting-path (conclusion)
r0 ∈ H, closed(H), ¬(∃ r1. path(x, r0, r1, H)) ⊦ ⟪eval#(r0, x, H; a?)⟫ (a? = none)
System applied rule normalize
And obtained the following new goals
Proof step 20
:
r0 ∈ H, closed(H), ∀ r1. ¬ path(x, r0, r1, H) ⊦ ⟪eval#(r0, x, H; a?)⟫ (a? = none)
Rule argument
Additional information
[]