Nuprl Lemma : Memory-class-exists
∀[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) supposing 0 < #(init loc(e))
Proof
Definitions occuring in Statement :
Memory-class: Memory-class(f;init;X),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-loc: loc(e),
es-E: E,
Id: Id,
less_than: a < b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
exists: ∃x:A. B[x],
squash: ↓T,
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],
member: t ∈ T,
uimplies: b supposing a,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
strongwellfounded: SWellFounded(R[x; y]),
exists: ∃x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
guard: {T},
squash: ↓T,
decidable: Dec(P),
or: P ∨ Q,
less_than: a < b,
le: A ≤ B,
less_than': less_than'(a;b),
uiff: uiff(P;Q),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
prior-iterated-classrel: prior-iterated-classrel(es;A;S;s;X;f;init;e),
cand: A c∧ B,
es-E: E,
es-base-E: es-base-E(es),
true: True,
gt: i > j,
eclass: EClass(A[eo; e]),
iterated-classrel: iterated-classrel(es;S;A;f;init;X;e;v),
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
bfalse: ff,
sq_type: SQType(T),
bnot: ¬bb,
assert: ↑b,
classrel: v ∈ X(e),
so_lambda: λ2x.t[x],
so_apply: x[s]
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].
\mdownarrow{}\mexists{}v:B. v \mmember{} Memory-class(f;init;X)(e) supposing 0 < \#(init loc(e))
Date html generated:
2016_05_17-AM-09_23_18
Last ObjectModification:
2016_01_17-PM-11_11_50
Theory : classrel!lemmas
Home
Index