Nuprl Lemma : fpf-sub-join
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a]]. {f ⊆ f ⊕ g ∧ g ⊆ f ⊕ g} supposing f || g
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-compatible: f || g,
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
guard: {T},
so_apply: x[s],
and: P ∧ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
guard: {T},
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
and: P ∧ Q,
cand: A c∧ B,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
prop: ℙ
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]].
\{f \msubseteq{} f \moplus{} g \mwedge{} g \msubseteq{} f \moplus{} g\} supposing f || g
Date html generated:
2016_05_16-AM-11_12_01
Last ObjectModification:
2015_12_29-AM-09_18_35
Theory : event-ordering
Home
Index