Nuprl Lemma : State-comb-classrel-mem3
∀[Info,B,A:Type]. ∀[f:A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)].
∀X:EClass(A). ∀es:EO+(Info). ∀e:E.
∀[v:B]
(v ∈ Memory-class(f;init;X)(e)
⇐⇒ ((↑first(e)) ∧ v ↓∈ init loc(e)) ∨ ((¬↑first(e)) ∧ v ∈ State-comb(init;f;X)(pred(e))))
Proof
Definitions occuring in Statement :
State-comb: State-comb(init;f;X),
Memory-class: Memory-class(f;init;X),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-first: first(e),
es-pred: pred(e),
es-loc: loc(e),
es-E: E,
Id: Id,
assert: ↑b,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
not: ¬A,
or: P ∨ Q,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
bag-member: x ↓∈ bs,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
rev_implies: P ⇐ Q,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
squash: ↓T,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
or: P ∨ Q,
cand: A c∧ B,
not: ¬A,
false: False,
guard: {T}
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]
(v \mmember{} Memory-class(f;init;X)(e)
\mLeftarrow{}{}\mRightarrow{} ((\muparrow{}first(e)) \mwedge{} v \mdownarrow{}\mmember{} init loc(e)) \mvee{} ((\mneg{}\muparrow{}first(e)) \mwedge{} v \mmember{} State-comb(init;f;X)(pred(e))))
Date html generated:
2016_05_17-AM-09_57_50
Last ObjectModification:
2016_01_17-PM-11_07_01
Theory : classrel!lemmas
Home
Index