Nuprl Lemma : es-interface-sublist_wf
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[X:EClass(Top)]. ∀[z:E List]. (es-interface-sublist(X;z) ∈ E(X) List)
Proof
Definitions occuring in Statement :
es-interface-sublist: es-interface-sublist(X;z),
es-E-interface: E(X),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-E: E,
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
es-interface-sublist: es-interface-sublist(X;z),
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
or: P ∨ Q,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
guard: {T},
decidable: Dec(P),
nil: [],
it: ⋅,
so_lambda: λ2x.t[x],
so_apply: x[s],
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
bool: 𝔹,
unit: Unit,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
es-E-interface: E(X),
bfalse: ff
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[X:EClass(Top)]. \mforall{}[z:E List].
(es-interface-sublist(X;z) \mmember{} E(X) List)
Date html generated:
2016_05_16-PM-02_49_37
Last ObjectModification:
2016_01_17-PM-07_28_23
Theory : event-ordering
Home
Index