Nuprl Lemma : Memory-class-es-sv
∀[Info,A:Type]. ∀[init:Id ⟶ bag(Top)]. ∀[f:Top]. ∀[X:EClass(A)]. ∀[es:EO+(Info)].
(es-sv-class(es;Memory-class(f;init;X))) supposing (es-sv-class(es;X) and (∀l:Id. (#(init l) ≤ 1)))
Proof
Definitions occuring in Statement :
Memory-class: Memory-class(f;init;X),
es-sv-class: es-sv-class(es;X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
Id: Id,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
le: A ≤ B,
all: ∀x:A. B[x],
apply: f a,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type,
bag-size: #(bs),
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
uimplies: b supposing a,
Memory-class: Memory-class(f;init;X),
Accum-class: Accum-class(f;init;X),
member: t ∈ T,
top: Top,
es-sv-class: es-sv-class(es;X),
prop: ℙ,
so_lambda: λ2x.t[x],
subtype_rel: A ⊆r B,
nat: ℕ,
so_apply: x[s],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
eclass: EClass(A[eo; e]),
implies: P ⇒ Q,
all: ∀x:A. B[x],
sq_stable: SqStable(P),
le: A ≤ B,
and: P ∧ Q,
not: ¬A,
false: False,
squash: ↓T
Latex:
\mforall{}[Info,A:Type]. \mforall{}[init:Id {}\mrightarrow{} bag(Top)]. \mforall{}[f:Top]. \mforall{}[X:EClass(A)]. \mforall{}[es:EO+(Info)].
(es-sv-class(es;Memory-class(f;init;X))) supposing
(es-sv-class(es;X) and
(\mforall{}l:Id. (\#(init l) \mleq{} 1)))
Date html generated:
2016_05_17-AM-09_32_49
Last ObjectModification:
2016_01_17-PM-11_07_24
Theory : classrel!lemmas
Home
Index