Nuprl Lemma : eclass-val_wf1

[A:es:EO'  E  Type]. [X:EClass'(A[es;e])]. [es:EO']. [e:E].  X(e)  A[es;e] supposing e  X


Proof not projected




Definitions occuring in Statement :  Message: Message eclass-val: X(e) in-eclass: e  X eclass: EClass(A[eo; e]) event-ordering+: EO+(Info) es-E: E assert: b uimplies: b supposing a uall: [x:A]. B[x] so_apply: x[s1;s2] member: t  T function: x:A  B[x] universe: Type
Definitions :  bool: void: Void atom: Atom es-base-E: es-base-E(es) token: "$token" msg-has-type: msg-has-type(m;T) cond-class: [X?Y] so_apply: x[s] implies: P  Q union: left + right or: P  Q guard: {T} eq_knd: a = b l_member: (x  l) fpf-dom: x  dom(f) bag: bag(T) so_lambda: x.t[x] fpf: a:A fp-B[a] record-select: r.x eq_atom: x =a y eq_atom: eq_atom$n(x;y) set: {x:A| B[x]}  decide: case b of inl(x) =s[x] | inr(y) =t[y] ifthenelse: if b then t else f fi  dep-isect: Error :dep-isect,  record+: record+ strong-subtype: strong-subtype(A;B) le: A  B ge: i  j  not: A less_than: a < b product: x:A  B[x] and: P  Q uiff: uiff(P;Q) subtype_rel: A r B top: Top in-eclass: e  X subtype: S  T lambda: x.A[x] es-E-interface: E(X) all: x:A. B[x] axiom: Ax eclass-val: X(e) apply: f a so_apply: x[s1;s2] prop: assert: b function: x:A  B[x] universe: Type uimplies: b supposing a equal: s = t so_lambda: x y.t[x; y] eclass: EClass(A[eo; e]) Message: Message uall: [x:A]. B[x] event-ordering+: EO+(Info) event_ordering: EO isect: x:A. B[x] es-E: E member: t  T
Lemmas :  eclass_wf Message_wf in-eclass_wf assert_wf subtype_rel_wf member_wf event-ordering+_wf event-ordering+_inc es-E_wf eclass-val_wf uall_wf es-base-E_wf subtype_rel_self es-interface-subtype_rel2 top_wf

\mforall{}[A:es:EO'  {}\mrightarrow{}  E  {}\mrightarrow{}  Type].  \mforall{}[X:EClass'(A[es;e])].  \mforall{}[es:EO'].  \mforall{}[e:E].
    X(e)  \mmember{}  A[es;e]  supposing  \muparrow{}e  \mmember{}\msubb{}  X


Date html generated: 2011_10_20-PM-04_51_50
Last ObjectModification: 2011_05_20-PM-05_01_37

Home Index