Nuprl Lemma : non-void-decl-join
∀[T:Type]. ∀eq:EqDecider(T). ∀d1,d2:a:T fp-> Type. (non-void(d1) ⇒ non-void(d2) ⇒ non-void(d1 ⊕ d2))
Proof
Definitions occuring in Statement :
non-void-decl: non-void(d),
fpf-join: f ⊕ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Definitions unfolded in proof :
non-void-decl: non-void(d),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
so_lambda: λ2x y.t[x; y],
prop: ℙ,
so_apply: x[s1;s2],
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top
Latex:
\mforall{}[T:Type]
\mforall{}eq:EqDecider(T). \mforall{}d1,d2:a:T fp-> Type. (non-void(d1) {}\mRightarrow{} non-void(d2) {}\mRightarrow{} non-void(d1 \moplus{} d2))
Date html generated:
2016_05_16-AM-11_32_04
Last ObjectModification:
2015_12_29-AM-09_27_37
Theory : event-ordering
Home
Index