Nuprl Lemma : primed-classrel
∀[Info,T:Type]. ∀[X:EClass(T)]. ∀[es:EO+(Info)]. ∀[v:T]. ∀[e:E].
uiff(v ∈ Prior(X)(e);↓∃e'<e.v ∈ X(e') ∧ ∀e''<e.∀w:T. (w ∈ X(e'') ⇒ e'' ≤loc e' ))
Proof
Definitions occuring in Statement :
primed-class: Prior(X),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
alle-lt: ∀e<e'.P[e],
existse-before: ∃e<e'.P[e],
es-le: e ≤loc e' ,
es-E: E,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
squash: ↓T,
implies: P ⇒ Q,
and: P ∧ Q,
universe: Type
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: ℙ,
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
so_apply: x[s],
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
primed-class: Prior(X),
eclass: EClass(A[eo; e]),
nat: ℕ,
or: P ∨ Q,
sq_exists: ∃x:{A| B[x]},
false: False,
existse-before: ∃e<e'.P[e],
exists: ∃x:A. B[x],
cand: A c∧ B,
alle-lt: ∀e<e'.P[e],
decidable: Dec(P),
not: ¬A,
es-locl: (e <loc e'),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
rev_uimplies: rev_uimplies(P;Q),
sq_stable: SqStable(P),
guard: {T},
es-le: e ≤loc e'
Latex:
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[es:EO+(Info)]. \mforall{}[v:T]. \mforall{}[e:E].
uiff(v \mmember{} Prior(X)(e);\mdownarrow{}\mexists{}e'<e.v \mmember{} X(e') \mwedge{} \mforall{}e''<e.\mforall{}w:T. (w \mmember{} X(e'') {}\mRightarrow{} e'' \mleq{}loc e' ))
Date html generated:
2016_05_17-AM-06_31_34
Last ObjectModification:
2016_01_17-PM-06_43_08
Theory : event-ordering
Home
Index