Nuprl Lemma : fpf-union_wf
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:x:A fp-> B[x] List]. ∀[x:A]. ∀[R:⋂a:A. ((B[a] List) ⟶ B[a] ⟶ 𝔹)].
(fpf-union(f;g;eq;R;x) ∈ B[x] List)
Proof
Definitions occuring in Statement :
fpf-union: fpf-union(f;g;eq;R;x),
fpf: a:A fp-> B[a],
list: T List,
deq: EqDecider(T),
bool: 𝔹,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
isect: ⋂x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-union: fpf-union(f;g;eq;R;x),
fpf-cap: f(x)?z,
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
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,
bfalse: ff,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
false: False,
bnot: ¬bb,
not: ¬A,
cand: A c∧ B
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:x:A fp-> B[x] List]. \mforall{}[x:A]. \mforall{}[R:\mcap{}a:A
((B[a] List)
{}\mrightarrow{} B[a]
{}\mrightarrow{} \mBbbB{})].
(fpf-union(f;g;eq;R;x) \mmember{} B[x] List)
Date html generated:
2016_05_16-AM-11_05_17
Last ObjectModification:
2015_12_29-AM-09_14_31
Theory : event-ordering
Home
Index