Nuprl Lemma : mapfilter-bor
∀T,U:Type. ∀f:T ⟶ U. ∀P,Q:T ⟶ 𝔹. ∀L:T List.
sub-bag(U;mapfilter(f;λx.(P[x] ∨bQ[x]);L);mapfilter(f;P;L) @ mapfilter(f;Q;L))
Proof
Definitions occuring in Statement :
mapfilter: mapfilter(f;P;L),
append: as @ bs,
list: T List,
bor: p ∨bq,
bool: 𝔹,
so_apply: x[s],
all: ∀x:A. B[x],
lambda: λx.A[x],
function: x:A ⟶ B[x],
universe: Type,
sub-bag: sub-bag(T;as;bs)
Definitions unfolded in proof :
all: ∀x:A. B[x],
sub-bag: sub-bag(T;as;bs),
exists: ∃x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_apply: x[s],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
bfalse: ff,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
prop: ℙ,
bag-append: as + bs
Latex:
\mforall{}T,U:Type. \mforall{}f:T {}\mrightarrow{} U. \mforall{}P,Q:T {}\mrightarrow{} \mBbbB{}. \mforall{}L:T List.
sub-bag(U;mapfilter(f;\mlambda{}x.(P[x] \mvee{}\msubb{}Q[x]);L);mapfilter(f;P;L) @ mapfilter(f;Q;L))
Date html generated:
2016_05_17-AM-08_56_20
Last ObjectModification:
2015_12_29-PM-02_53_27
Theory : messages
Home
Index