Nuprl Lemma : loop-class-memory-exists-prior
∀[Info,B:Type]. ∀[X:EClass(B ⟶ B)]. ∀[init:Id ⟶ bag(B)]. ∀[es:EO+(Info)]. ∀[e:E].
  uiff(0 < #(init loc(e));↓∃v:B. v ∈ Prior(loop-class-memory(X;init))?init(e))
Proof
Definitions occuring in Statement : 
loop-class-memory: loop-class-memory(X;init)
, 
primed-class-opt: Prior(X)?b
, 
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
, 
uiff: uiff(P;Q)
, 
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
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
uimplies: b supposing a
, 
squash: ↓T
, 
prop: ℙ
, 
subtype_rel: A ⊆r B
, 
nat: ℕ
, 
so_lambda: λ2x.t[x]
, 
so_apply: x[s]
, 
so_lambda: λ2x y.t[x; y]
, 
so_apply: x[s1;s2]
, 
all: ∀x:A. B[x]
, 
decidable: Dec(P)
, 
or: P ∨ Q
, 
exists: ∃x:A. B[x]
, 
rev_uimplies: rev_uimplies(P;Q)
, 
guard: {T}
, 
cand: A c∧ B
, 
implies: P 
⇒ Q
, 
not: ¬A
, 
false: False
, 
es-E: E
, 
es-base-E: es-base-E(es)
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
es-p-local-pred: es-p-local-pred(es;P)
, 
es-locl: (e <loc e')
Latex:
\mforall{}[Info,B:Type].  \mforall{}[X:EClass(B  {}\mrightarrow{}  B)].  \mforall{}[init:Id  {}\mrightarrow{}  bag(B)].  \mforall{}[es:EO+(Info)].  \mforall{}[e:E].
    uiff(0  <  \#(init  loc(e));\mdownarrow{}\mexists{}v:B.  v  \mmember{}  Prior(loop-class-memory(X;init))?init(e))
Date html generated:
2016_05_16-PM-11_38_54
Last ObjectModification:
2016_01_17-PM-07_05_10
Theory : event-ordering
Home
Index