Nuprl Lemma : bind-zero-right
∀[Info,T:Type]. ∀[X:EClass(T)]. (X >x> Empty = Empty ∈ EClass(T))
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],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
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],
prop: ℙ,
uimplies: b supposing a,
all: ∀x:A. B[x],
implies: P ⇒ Q,
squash: ↓T,
so_lambda: λ2x.t[x],
so_apply: x[s],
true: True
Latex:
\mforall{}[Info,T:Type]. \mforall{}[X:EClass(T)]. (X >x> Empty = Empty)
Date html generated:
2016_05_16-PM-02_25_50
Last ObjectModification:
2016_01_17-PM-07_34_37
Theory : event-ordering
Home
Index