Nuprl Lemma : first-at-filter-interface-predecessors1
∀[Info:Type]. ∀[es:EO+(Info)]. ∀[T:Type]. ∀[X:EClass(T)]. ∀[P:E(X) ⟶ 𝔹]. ∀[n:ℕ+]. ∀[e:E]. ∀[i:Id].
{(↑e ∈b X) ∧ (↑P[e])} supposing e is first@ i s.t. q.||filter(λe.P[e];≤(X)(q))|| = n ∈ ℤ
Proof
Definitions occuring in Statement :
es-interface-predecessors: ≤(X)(e),
es-E-interface: E(X),
in-eclass: e ∈b X,
eclass: EClass(A[eo; e]),
event-ordering+: EO+(Info),
es-first-at: e is first@ i s.t. e.P[e],
es-E: E,
Id: Id,
length: ||as||,
filter: filter(P;l),
nat_plus: ℕ+,
assert: ↑b,
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
guard: {T},
so_apply: x[s],
and: P ∧ Q,
lambda: λx.A[x],
function: x:A ⟶ B[x],
int: ℤ,
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
guard: {T},
all: ∀x:A. B[x],
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
cand: A c∧ B,
es-E-interface: E(X),
implies: P ⇒ Q,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
not: ¬A,
false: False,
nat_plus: ℕ+,
and: P ∧ Q,
true: True,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
squash: ↓T,
iff: P ⇐⇒ Q,
or: P ∨ Q,
sq_type: SQType(T),
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
btrue: tt,
bfalse: ff,
append: as @ bs,
so_lambda: so_lambda(x,y,z.t[x; y; z]),
so_apply: x[s1;s2;s3],
es-locl: (e <loc e'),
rev_implies: P ⇐ Q
Latex:
\mforall{}[Info:Type]. \mforall{}[es:EO+(Info)]. \mforall{}[T:Type]. \mforall{}[X:EClass(T)]. \mforall{}[P:E(X) {}\mrightarrow{} \mBbbB{}]. \mforall{}[n:\mBbbN{}\msupplus{}]. \mforall{}[e:E]. \mforall{}[i:Id].
\{(\muparrow{}e \mmember{}\msubb{} X) \mwedge{} (\muparrow{}P[e])\} supposing e is first@ i s.t. q.||filter(\mlambda{}e.P[e];\mleq{}(X)(q))|| = n
Date html generated:
2016_05_17-AM-07_07_50
Last ObjectModification:
2016_01_17-PM-03_06_43
Theory : event-ordering
Home
Index