Nuprl Lemma : fpf-union-join-member
∀[A:Type]
∀eq:EqDecider(A)
∀[B:A ⟶ Type]
∀f,g:a:A fp-> B[a] List. ∀R:⋂a:A. ((B[a] List) ⟶ B[a] ⟶ 𝔹). ∀a:A.
∀x:B[a]. ((x ∈ fpf-union-join(eq;R;f;g)(a)) ⇒ (((↑a ∈ dom(f)) ∧ (x ∈ f(a))) ∨ ((↑a ∈ dom(g)) ∧ (x ∈ g(a)))))
supposing ↑a ∈ dom(fpf-union-join(eq;R;f;g))
Proof
Definitions occuring in Statement :
fpf-union-join: fpf-union-join(eq;R;f;g),
fpf-ap: f(x),
fpf-dom: x ∈ dom(f),
fpf: a:A fp-> B[a],
l_member: (x ∈ l),
list: T List,
deq: EqDecider(T),
assert: ↑b,
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
or: P ∨ Q,
and: P ∧ Q,
isect: ⋂x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
uimplies: b supposing a,
member: t ∈ T,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
implies: P ⇒ Q,
prop: ℙ,
top: Top,
fpf-union: fpf-union(f;g;eq;R;x),
fpf-cap: f(x)?z,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
assert: ↑b,
bfalse: ff,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
false: False,
cand: A c∧ B,
true: True,
not: ¬A,
iff: P ⇐⇒ Q
Latex:
\mforall{}[A:Type]
\mforall{}eq:EqDecider(A)
\mforall{}[B:A {}\mrightarrow{} Type]
\mforall{}f,g:a:A fp-> B[a] List. \mforall{}R:\mcap{}a:A. ((B[a] List) {}\mrightarrow{} B[a] {}\mrightarrow{} \mBbbB{}). \mforall{}a:A.
\mforall{}x:B[a]
((x \mmember{} fpf-union-join(eq;R;f;g)(a))
{}\mRightarrow{} (((\muparrow{}a \mmember{} dom(f)) \mwedge{} (x \mmember{} f(a))) \mvee{} ((\muparrow{}a \mmember{} dom(g)) \mwedge{} (x \mmember{} g(a)))))
supposing \muparrow{}a \mmember{} dom(fpf-union-join(eq;R;f;g))
Date html generated:
2016_05_16-AM-11_14_29
Last ObjectModification:
2015_12_29-AM-09_22_38
Theory : event-ordering
Home
Index