Nuprl Lemma : fpf-join-list-domain
∀[A:Type]
∀eq:EqDecider(A)
∀[B:A ⟶ Type]. ∀L:a:A fp-> B[a] List. ∀x:A. ((x ∈ fpf-domain(⊕(L))) ⇐⇒ (∃f∈L. (x ∈ fpf-domain(f))))
Proof
Definitions occuring in Statement :
fpf-join-list: ⊕(L),
fpf-domain: fpf-domain(f),
fpf: a:A fp-> B[a],
l_exists: (∃x∈L. P[x]),
l_member: (x ∈ l),
list: T List,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
and: P ∧ Q,
implies: P ⇒ Q,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
rev_implies: P ⇐ Q,
prop: ℙ,
guard: {T}
Latex:
\mforall{}[A:Type]
\mforall{}eq:EqDecider(A)
\mforall{}[B:A {}\mrightarrow{} Type]
\mforall{}L:a:A fp-> B[a] List. \mforall{}x:A. ((x \mmember{} fpf-domain(\moplus{}(L))) \mLeftarrow{}{}\mRightarrow{} (\mexists{}f\mmember{}L. (x \mmember{} fpf-domain(f))))
Date html generated:
2016_05_16-AM-11_12_44
Last ObjectModification:
2015_12_29-AM-09_19_46
Theory : event-ordering
Home
Index