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