Nuprl Lemma : is-prior-val-iff-prior-interface
∀[Info,T:Type]. ∀[X:EClass(T)]. ∀[es:EO+(Info)]. ∀[e:E]. uiff(↑e ∈b (X)';↑e ∈b prior(X))
Proof
Definitions occuring in Statement :
es-prior-val: (X)',
es-prior-interface: prior(X),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
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,
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
prop: ℙ
Latex:
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E]. uiff(\muparrow{}e \mmember{}\msubb{} (X)';\muparrow{}e \mmember{}\msubb{} prior(X))
Date html generated:
2016_05_17-AM-06_33_12
Last ObjectModification:
2015_12_29-AM-00_35_36
Theory : event-ordering
Home
Index