Nuprl Lemma : prior-classrel
∀[T,Info:Type]. ∀[X:EClass(T)]. ∀[es:EO+(Info)]. ∀[e:E]. ∀[v:T].
uiff(v ∈ Prior(X)(e);↓∃e':E. (((last(λe'.0 <z #(X es e')) e) = (inl e') ∈ (E + Top)) ∧ v ∈ X(e')))
Proof
Definitions occuring in Statement :
primed-class: Prior(X),
es-local-pred: last(P),
classrel: v ∈ X(e),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
lt_int: i <z j,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
top: Top,
exists: ∃x:A. B[x],
squash: ↓T,
and: P ∧ Q,
apply: f a,
lambda: λx.A[x],
inl: inl x,
union: left + right,
natural_number: $n,
universe: Type,
equal: s = t ∈ T,
bag-size: #(bs)
Definitions unfolded in proof :
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
squash: ↓T,
prop: ℙ,
uall: ∀[x:A]. B[x],
classrel: v ∈ X(e),
bag-member: x ↓∈ bs,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
eclass: EClass(A[eo; e]),
or: P ∨ Q,
implies: P ⇒ Q,
so_apply: x[s],
all: ∀x:A. B[x],
sq_exists: ∃x:{A| B[x]},
top: Top,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
primed-class: Prior(X),
nat: ℕ,
exists: ∃x:A. B[x],
cand: A c∧ B,
false: False,
sq_stable: SqStable(P)
Latex:
\mforall{}[T,Info:Type]. \mforall{}[X:EClass(T)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E]. \mforall{}[v:T].
uiff(v \mmember{} Prior(X)(e);\mdownarrow{}\mexists{}e':E. (((last(\mlambda{}e'.0 <z \#(X es e')) e) = (inl e')) \mwedge{} v \mmember{} X(e')))
Date html generated:
2016_05_17-AM-09_27_06
Last ObjectModification:
2016_01_17-PM-11_10_16
Theory : classrel!lemmas
Home
Index