Nuprl Lemma : bind-zero-left
∀[Info,T,S:Type]. ∀f:T ⟶ EClass(S). (Empty >z> f[z] = Empty ∈ EClass(S))
Proof
Definitions occuring in Statement :
bind-class: X >x> Y[x],
es-empty-interface: Empty,
eclass: EClass(A[eo; e]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
eclass: EClass(A[eo; e]),
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
es-empty-interface: Empty,
bind-class: X >x> Y[x],
so_lambda: λ2x.t[x],
top: Top,
so_apply: x[s],
prop: ℙ,
uimplies: b supposing a,
implies: P ⇒ Q
Latex:
\mforall{}[Info,T,S:Type]. \mforall{}f:T {}\mrightarrow{} EClass(S). (Empty >z> f[z] = Empty)
Date html generated:
2016_05_16-PM-02_26_34
Last ObjectModification:
2015_12_29-AM-11_43_24
Theory : event-ordering
Home
Index