Nuprl Lemma : Memory-loc-class-exists
∀[Info,B,A:Type]. ∀[f:Id ⟶ A ⟶ B ⟶ B]. ∀[init:Id ⟶ bag(B)]. ∀[X:EClass(A)]. ∀[es:EO+(Info)]. ∀[e:E].
↓∃v:B. v ∈ Memory-loc-class(f;init;X)(e) supposing 0 < #(init loc(e))
Proof
Definitions occuring in Statement :
Memory-loc-class: Memory-loc-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,
subtype_rel: A ⊆r B,
squash: ↓T,
exists: ∃x:A. B[x],
uiff: uiff(P;Q),
and: P ∧ Q,
prop: ℙ,
nat: ℕ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,B,A:Type]. \mforall{}[f:Id {}\mrightarrow{} 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-loc-class(f;init;X)(e) supposing 0 < \#(init loc(e))
Date html generated:
2016_05_17-AM-09_23_21
Last ObjectModification:
2016_01_17-PM-11_10_57
Theory : classrel!lemmas
Home
Index