[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 18 from proof always-noincrease-stable (
previous step
)
□ (A'' ≪ A ∨ A'' = A) ⊦ □ ⟨a := A⟩ (□ (A ≪ a ∨ A = a))
User applied rule execute always
And obtained the following new goals
Proof step 19
:
□ (A'' ≪ A ∨ A'' = A), A'' ≪ A ∨ A'' = A ⊦ ⟨a := A⟩ (□ (A ≪ a ∨ A = a))
Rule argument
pos: right 1
Additional information