Nuprl Lemma : non-void-decl-single
∀[T,A:Type]. ∀x:T. ∀eq:EqDecider(T). (A ⇒ non-void(x : A))
Proof
Definitions occuring in Statement :
non-void-decl: non-void(d),
fpf-single: x : v,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
universe: Type
Lemmas :
fpf-all-single-decl,
deq_wf
\mforall{}[T,A:Type]. \mforall{}x:T. \mforall{}eq:EqDecider(T). (A {}\mRightarrow{} non-void(x : A))
Date html generated:
2015_07_17-AM-11_14_10
Last ObjectModification:
2015_01_28-AM-07_40_31
Home
Index