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