Nuprl Lemma : Memory-classrel-single-val
∀[Info,B,A:Type].
∀f:A ⟶ B ⟶ B. ∀init:Id ⟶ bag(B). ∀X:EClass(A). ∀es:EO+(Info). ∀e:E. ∀v:B.
(uiff(v ∈ Memory-class(f;init;X)(e);prior-iterated-classrel(es;A;B;v;X;f;init;e))) supposing
(single-valued-classrel(es;X;A) and
single-valued-bag(init loc(e);B))
Proof
Definitions occuring in Statement :
Memory-class: Memory-class(f;init;X),
prior-iterated-classrel: prior-iterated-classrel(es;A;S;s;X;f;init;e),
single-valued-classrel: single-valued-classrel(es;X;T),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
uiff: uiff(P;Q),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
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],
uimplies: b supposing a,
member: t ∈ T,
single-valued-bag: single-valued-bag(b;T),
implies: P ⇒ Q,
subtype_rel: A ⊆r B,
prop: ℙ,
single-valued-classrel: single-valued-classrel(es;X;T),
uiff: uiff(P;Q),
and: P ∧ Q,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
squash: ↓T,
iff: P ⇐⇒ Q,
sq_stable: SqStable(P),
rev_implies: P ⇐ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,B,A:Type].
\mforall{}f:A {}\mrightarrow{} B {}\mrightarrow{} B. \mforall{}init:Id {}\mrightarrow{} bag(B). \mforall{}X:EClass(A). \mforall{}es:EO+(Info). \mforall{}e:E. \mforall{}v:B.
(uiff(v \mmember{} Memory-class(f;init;X)(e);prior-iterated-classrel(es;A;B;v;X;f;init;e))) supposing
(single-valued-classrel(es;X;A) and
single-valued-bag(init loc(e);B))
Date html generated:
2016_05_17-AM-09_23_07
Last ObjectModification:
2016_01_17-PM-11_11_09
Theory : classrel!lemmas
Home
Index