Nuprl Lemma : interface-pair-val
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X,Y:EClass(Top)]. ∀[e:E]. (X,Y)(e) ~ <X(e), Y(e)> supposing ↑e ∈b (X,Y)
Proof
Definitions occuring in Statement :
es-interface-pair: (X,Y),
eclass-val: X(e),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
assert: ↑b,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
pair: <a, b>,
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
eclass-val: X(e),
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-interface-pair: (X,Y),
eclass-compose2: eclass-compose2(f;X;Y),
in-eclass: e ∈b X,
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,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
top: Top,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
not: ¬A,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X,Y:EClass(Top)]. \mforall{}[e:E]. (X,Y)(e) \msim{} <X(e), Y(e)> supposing \muparrow{}e \mmember{}\msubb{} \000C(X,Y)
Date html generated:
2016_05_17-AM-07_13_23
Last ObjectModification:
2015_12_29-AM-00_03_40
Theory : event-ordering
Home
Index