Nuprl Lemma : map-concat-filter-lemma1
∀[A,B:Type]. ∀[L2:(tg:Id × (A ⟶ B ⟶ (Top List))) List]. ∀[L:(Top × Id × Top) List]. ∀[tg:Id]. ∀[a:A]. ∀[b:B].
{(filter(λms.fst(snd(ms)) = tg;L) = [] ∈ ((Top × Id × Top) List)) supposing
((¬(tg ∈ map(λp.(fst(p));L2))) and
(map(λx.(snd(x));L) = concat(map(λtgf.map(λx.<fst(tgf), x>;(snd(tgf)) a b);L2)) ∈ ((tg:Id × Top) List)))}
Proof
Definitions occuring in Statement :
eq_id: a = b,
Id: Id,
l_member: (x ∈ l),
concat: concat(ll),
filter: filter(P;l),
map: map(f;as),
nil: [],
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
top: Top,
guard: {T},
pi1: fst(t),
pi2: snd(t),
not: ¬A,
apply: f a,
lambda: λx.A[x],
function: x:A ⟶ B[x],
pair: <a, b>,
product: x:A × B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
guard: {T},
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
prop: ℙ,
uiff: uiff(P;Q),
and: P ∧ Q,
rev_uimplies: rev_uimplies(P;Q),
not: ¬A,
implies: P ⇒ Q,
false: False,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
pi2: snd(t),
pi1: fst(t),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
exists: ∃x:A. B[x],
cand: A c∧ B
Latex:
\mforall{}[A,B:Type]. \mforall{}[L2:(tg:Id \mtimes{} (A {}\mrightarrow{} B {}\mrightarrow{} (Top List))) List]. \mforall{}[L:(Top \mtimes{} Id \mtimes{} Top) List]. \mforall{}[tg:Id].
\mforall{}[a:A]. \mforall{}[b:B].
\{(filter(\mlambda{}ms.fst(snd(ms)) = tg;L) = []) supposing
((\mneg{}(tg \mmember{} map(\mlambda{}p.(fst(p));L2))) and
(map(\mlambda{}x.(snd(x));L) = concat(map(\mlambda{}tgf.map(\mlambda{}x.<fst(tgf), x>(snd(tgf)) a b);L2))))\}
Date html generated:
2016_05_16-AM-10_59_36
Last ObjectModification:
2015_12_29-AM-09_11_41
Theory : event-ordering
Home
Index