Step
*
1
of Lemma
Memory-class-progress
1. [Info] : Type
2. [B] : Type
3. [A] : Type
4. R : B ─→ B ─→ ℙ@i'
5. P : A ─→ B ─→ ℙ@i'
6. f : A ─→ B ─→ B@i
7. init : Id ─→ bag(B)@i
8. X : EClass(A)@i'
9. es : EO+(Info)@i'
10. e1 : E@i
11. e2 : E@i
12. v1 : B@i
13. v2 : B@i
14. ∀a:A. ∀s:B. Dec(P[a;s])@i
15. Trans(B;x,y.R[x;y])@i
16. ∀s1,s2:B. SqStable(R[s1;s2])@i
17. ∀a:A. ∀e:E. ∀s:B.
(e1 ≤loc e
⇒ (e <loc e2)
⇒ a ∈ X(e)
⇒ s ∈ Memory-class(f;init;X)(e)
⇒ ((P[a;s] ⇒ R[s;f a s]) ∧ ((¬P[a;s]) ⇒ (s = (f a s) ∈ B))))@i
18. single-valued-classrel(es;X;A)@i
19. single-valued-bag(init loc(e1);B)@i
20. ↑first(e1)
21. v1 ↓∈ init loc(e1)
22. ¬↑first(e2)
23. iterated_classrel(es;B;A;f;init;X;pred(e2);v2)
24. (e1 <loc e2)@i
25. ∃e:E. ∃a:A. ∃s:B. (e1 ≤loc e ∧ (e <loc e2) ∧ s ∈ Memory-class(f;init;X)(e) ∧ a ∈ X(e) ∧ P[a;s])@i
⊢ R[v1;v2]
BY
{ ((InstLemma `decidable__exists-single-valued-classrel` [⌈Info⌉;⌈A⌉;⌈X⌉;⌈es⌉;⌈e1⌉]⋅ THENA Auto) THEN D (-1)) }
1
1. [Info] : Type
2. [B] : Type
3. [A] : Type
4. R : B ─→ B ─→ ℙ@i'
5. P : A ─→ B ─→ ℙ@i'
6. f : A ─→ B ─→ B@i
7. init : Id ─→ bag(B)@i
8. X : EClass(A)@i'
9. es : EO+(Info)@i'
10. e1 : E@i
11. e2 : E@i
12. v1 : B@i
13. v2 : B@i
14. ∀a:A. ∀s:B. Dec(P[a;s])@i
15. Trans(B;x,y.R[x;y])@i
16. ∀s1,s2:B. SqStable(R[s1;s2])@i
17. ∀a:A. ∀e:E. ∀s:B.
(e1 ≤loc e
⇒ (e <loc e2)
⇒ a ∈ X(e)
⇒ s ∈ Memory-class(f;init;X)(e)
⇒ ((P[a;s] ⇒ R[s;f a s]) ∧ ((¬P[a;s]) ⇒ (s = (f a s) ∈ B))))@i
18. single-valued-classrel(es;X;A)@i
19. single-valued-bag(init loc(e1);B)@i
20. ↑first(e1)
21. v1 ↓∈ init loc(e1)
22. ¬↑first(e2)
23. iterated_classrel(es;B;A;f;init;X;pred(e2);v2)
24. (e1 <loc e2)@i
25. ∃e:E. ∃a:A. ∃s:B. (e1 ≤loc e ∧ (e <loc e2) ∧ s ∈ Memory-class(f;init;X)(e) ∧ a ∈ X(e) ∧ P[a;s])@i
26. ∃v:A. v ∈ X(e1)
⊢ R[v1;v2]
2
1. [Info] : Type
2. [B] : Type
3. [A] : Type
4. R : B ─→ B ─→ ℙ@i'
5. P : A ─→ B ─→ ℙ@i'
6. f : A ─→ B ─→ B@i
7. init : Id ─→ bag(B)@i
8. X : EClass(A)@i'
9. es : EO+(Info)@i'
10. e1 : E@i
11. e2 : E@i
12. v1 : B@i
13. v2 : B@i
14. ∀a:A. ∀s:B. Dec(P[a;s])@i
15. Trans(B;x,y.R[x;y])@i
16. ∀s1,s2:B. SqStable(R[s1;s2])@i
17. ∀a:A. ∀e:E. ∀s:B.
(e1 ≤loc e
⇒ (e <loc e2)
⇒ a ∈ X(e)
⇒ s ∈ Memory-class(f;init;X)(e)
⇒ ((P[a;s] ⇒ R[s;f a s]) ∧ ((¬P[a;s]) ⇒ (s = (f a s) ∈ B))))@i
18. single-valued-classrel(es;X;A)@i
19. single-valued-bag(init loc(e1);B)@i
20. ↑first(e1)
21. v1 ↓∈ init loc(e1)
22. ¬↑first(e2)
23. iterated_classrel(es;B;A;f;init;X;pred(e2);v2)
24. (e1 <loc e2)@i
25. ∃e:E. ∃a:A. ∃s:B. (e1 ≤loc e ∧ (e <loc e2) ∧ s ∈ Memory-class(f;init;X)(e) ∧ a ∈ X(e) ∧ P[a;s])@i
26. ¬(∃v:A. v ∈ X(e1))
⊢ R[v1;v2]
Latex:
Latex:
1. [Info] : Type
2. [B] : Type
3. [A] : Type
4. R : B {}\mrightarrow{} B {}\mrightarrow{} \mBbbP{}@i'
5. P : A {}\mrightarrow{} B {}\mrightarrow{} \mBbbP{}@i'
6. f : A {}\mrightarrow{} B {}\mrightarrow{} B@i
7. init : Id {}\mrightarrow{} bag(B)@i
8. X : EClass(A)@i'
9. es : EO+(Info)@i'
10. e1 : E@i
11. e2 : E@i
12. v1 : B@i
13. v2 : B@i
14. \mforall{}a:A. \mforall{}s:B. Dec(P[a;s])@i
15. Trans(B;x,y.R[x;y])@i
16. \mforall{}s1,s2:B. SqStable(R[s1;s2])@i
17. \mforall{}a:A. \mforall{}e:E. \mforall{}s:B.
(e1 \mleq{}loc e
{}\mRightarrow{} (e <loc e2)
{}\mRightarrow{} a \mmember{} X(e)
{}\mRightarrow{} s \mmember{} Memory-class(f;init;X)(e)
{}\mRightarrow{} ((P[a;s] {}\mRightarrow{} R[s;f a s]) \mwedge{} ((\mneg{}P[a;s]) {}\mRightarrow{} (s = (f a s)))))@i
18. single-valued-classrel(es;X;A)@i
19. single-valued-bag(init loc(e1);B)@i
20. \muparrow{}first(e1)
21. v1 \mdownarrow{}\mmember{} init loc(e1)
22. \mneg{}\muparrow{}first(e2)
23. iterated\_classrel(es;B;A;f;init;X;pred(e2);v2)
24. (e1 <loc e2)@i
25. \mexists{}e:E
\mexists{}a:A. \mexists{}s:B. (e1 \mleq{}loc e \mwedge{} (e <loc e2) \mwedge{} s \mmember{} Memory-class(f;init;X)(e) \mwedge{} a \mmember{} X(e) \mwedge{} P[a;s])@i
\mvdash{} R[v1;v2]
By
Latex:
((InstLemma `decidable\_\_exists-single-valued-classrel` [\mkleeneopen{}Info\mkleeneclose{};\mkleeneopen{}A\mkleeneclose{};\mkleeneopen{}X\mkleeneclose{};\mkleeneopen{}es\mkleeneclose{};\mkleeneopen{}e1\mkleeneclose{}]\mcdot{} THENA Auto)
THEN D (-1)
)
Home
Index