Nuprl Lemma : is-return-class
∀[Info:Type]. ∀[x:Top]. ∀[es:EO+(Info)]. ∀[e:E]. (e ∈b return-class(x) ~ first(e))
Proof
Definitions occuring in Statement :
return-class: return-class(x),
in-eclass: e ∈b X,
event-ordering+: EO+(Info),
es-first: first(e),
es-E: E,
uall: ∀[x:A]. B[x],
top: Top,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
return-class: return-class(x),
in-eclass: e ∈b X,
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
top: Top,
eq_int: (i =z j),
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False
Latex:
\mforall{}[Info:Type]. \mforall{}[x:Top]. \mforall{}[es:EO+(Info)]. \mforall{}[e:E]. (e \mmember{}\msubb{} return-class(x) \msim{} first(e))
Date html generated:
2016_05_16-PM-02_25_09
Last ObjectModification:
2015_12_29-AM-11_42_56
Theory : event-ordering
Home
Index