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
Lemmas :
fpf-all-join-decl,
fpf-all_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top,
fpf_wf,
deq_wf
\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:
2015_07_17-AM-11_14_07
Last ObjectModification:
2015_01_28-AM-07_40_56
Home
Index