Nuprl Lemma : es-E-interface-first-class
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[A:Type]. ∀[Ias:EClass(A) List]. ∀[i:ℕ||Ias||]. (E(Ias[i]) ⊆r E(first-class(Ias)))
Proof
Definitions occuring in Statement :
es-E-interface: E(X),
first-class: first-class(L),
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
select: L[n],
length: ||as||,
list: T List,
int_seg: {i..j-},
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
and: P ∧ Q,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
implies: P ⇒ Q,
not: ¬A,
top: Top,
prop: ℙ,
less_than: a < b,
squash: ↓T,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
l_exists: (∃x∈L. P[x])
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[A:Type]. \mforall{}[Ias:EClass(A) List]. \mforall{}[i:\mBbbN{}||Ias||].
(E(Ias[i]) \msubseteq{}r E(first-class(Ias)))
Date html generated:
2016_05_16-PM-10_56_35
Last ObjectModification:
2016_01_17-PM-07_16_17
Theory : event-ordering
Home
Index