Step
*
of Lemma
loop-class-state-exists
∀[Info,B:Type]. ∀[X:EClass(B ─→ B)]. ∀[init:Id ─→ bag(B)]. ∀[es:EO+(Info)]. ∀[e:E].
uiff(0 < #(init loc(e));↓∃v:B. v ∈ loop-class-state(X;init)(e))
BY
{ ((UnivCD THENA Auto) THEN MoveToConcl (-1) THEN CausalInd' THEN Auto) }
1
1. Info : Type
2. B : Type
3. X : EClass(B ─→ B)
4. init : Id ─→ bag(B)
5. es : EO+(Info)
6. e : E@i
7. ∀e1:E. ((e1 < e)
⇒ uiff(0 < #(init loc(e1));↓∃v:B. v ∈ loop-class-state(X;init)(e1)))
8. 0 < #(init loc(e))
⊢ ↓∃v:B. v ∈ loop-class-state(X;init)(e)
2
1. Info : Type
2. B : Type
3. X : EClass(B ─→ B)
4. init : Id ─→ bag(B)
5. es : EO+(Info)
6. e : E@i
7. ∀e1:E. ((e1 < e)
⇒ uiff(0 < #(init loc(e1));↓∃v:B. v ∈ loop-class-state(X;init)(e1)))
8. ∃v:B. v ∈ loop-class-state(X;init)(e)
⊢ 0 < #(init loc(e))
Latex:
Latex:
\mforall{}[Info,B:Type]. \mforall{}[X:EClass(B {}\mrightarrow{} B)]. \mforall{}[init:Id {}\mrightarrow{} bag(B)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E].
uiff(0 < \#(init loc(e));\mdownarrow{}\mexists{}v:B. v \mmember{} loop-class-state(X;init)(e))
By
Latex:
((UnivCD THENA Auto) THEN MoveToConcl (-1) THEN CausalInd' THEN Auto)
Home
Index