Nuprl Lemma : Memory-class-trans
∀[Info,B,A:Type].
∀R:B ⟶ B ⟶ ℙ. ∀f:A ⟶ B ⟶ B. ∀init:Id ⟶ bag(B). ∀X:EClass(A). ∀es:EO+(Info). ∀e1,e2:E. ∀v1,v2:B.
(Trans(B;x,y.R[x;y])
⇒ (∀s1,s2:B. SqStable(R[s1;s2]))
⇒ (∀a:A. ∀e:E. (a ∈ X(e) ⇒ (∀s:B. R[s;f a s])))
⇒ single-valued-classrel(es;X;A)
⇒ single-valued-bag(init loc(e1);B)
⇒ v1 ∈ Memory-class(f;init;X)(e1)
⇒ v2 ∈ Memory-class(f;init;X)(e2)
⇒ (e1 <loc e2)
⇒ (∃e:E. (e1 ≤loc e ∧ (e <loc e2) ∧ (∃a:A. a ∈ X(e))))
⇒ R[v1;v2])
Proof
Definitions occuring in Statement :
Memory-class: Memory-class(f;init;X),
single-valued-classrel: single-valued-classrel(es;X;T),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-le: e ≤loc e' ,
es-locl: (e <loc e'),
es-loc: loc(e),
es-E: E,
Id: Id,
trans: Trans(T;x,y.E[x; y]),
sq_stable: SqStable(P),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
single-valued-bag: single-valued-bag(b;T),
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
or: P ∨ Q,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
not: ¬A,
false: False,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
exists: ∃x:A. B[x],
so_apply: x[s1;s2],
so_lambda: λ2x y.t[x; y],
decidable: Dec(P),
iterated_classrel: iterated_classrel(es;S;A;f;init;X;e;v),
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
rev_implies: P ⇐ Q,
sq_type: SQType(T),
guard: {T},
cand: A c∧ B,
squash: ↓T,
es-locl: (e <loc e'),
trans: Trans(T;x,y.E[x; y]),
es-le: e ≤loc e' ,
es-E: E,
es-base-E: es-base-E(es)
Latex:
\mforall{}[Info,B,A:Type].
\mforall{}R:B {}\mrightarrow{} B {}\mrightarrow{} \mBbbP{}. \mforall{}f:A {}\mrightarrow{} B {}\mrightarrow{} B. \mforall{}init:Id {}\mrightarrow{} bag(B). \mforall{}X:EClass(A). \mforall{}es:EO+(Info). \mforall{}e1,e2:E.
\mforall{}v1,v2:B.
(Trans(B;x,y.R[x;y])
{}\mRightarrow{} (\mforall{}s1,s2:B. SqStable(R[s1;s2]))
{}\mRightarrow{} (\mforall{}a:A. \mforall{}e:E. (a \mmember{} X(e) {}\mRightarrow{} (\mforall{}s:B. R[s;f a s])))
{}\mRightarrow{} single-valued-classrel(es;X;A)
{}\mRightarrow{} single-valued-bag(init loc(e1);B)
{}\mRightarrow{} v1 \mmember{} Memory-class(f;init;X)(e1)
{}\mRightarrow{} v2 \mmember{} Memory-class(f;init;X)(e2)
{}\mRightarrow{} (e1 <loc e2)
{}\mRightarrow{} (\mexists{}e:E. (e1 \mleq{}loc e \mwedge{} (e <loc e2) \mwedge{} (\mexists{}a:A. a \mmember{} X(e))))
{}\mRightarrow{} R[v1;v2])
Date html generated:
2016_05_17-AM-09_24_24
Last ObjectModification:
2016_01_17-PM-11_12_50
Theory : classrel!lemmas
Home
Index