Nuprl Lemma : es-interface-right-as-image
∀[Info,A,B:Type]. ∀[X:EClass(A + B)]. (right(X) = λx.case x of inl(a) => {} | inr(b) => {b}[X] ∈ EClass(B))
Proof
Definitions occuring in Statement :
es-interface-right: right(X),
es-filter-image: f[X],
eclass: EClass(A[eo; e]),
uall: ∀[x:A]. B[x],
lambda: λx.A[x],
decide: case b of inl(x) => s[x] | inr(y) => t[y],
union: left + right,
universe: Type,
equal: s = t ∈ T,
single-bag: {x},
empty-bag: {}
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
es-filter-image: f[X],
es-interface-right: right(X),
eclass: EClass(A[eo; e]),
eclass-compose1: f o X,
eclass-val: X(e),
in-eclass: e ∈b X,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
ifthenelse: if b then t else f fi ,
bfalse: ff,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
top: Top,
exists: ∃x:A. B[x],
prop: ℙ,
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b,
false: False,
so_lambda: λ2x.t[x],
true: True,
squash: ↓T,
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
single-bag: {x},
bag-separate: bag-separate(bs),
pi2: snd(t),
bag-mapfilter: bag-mapfilter(f;P;bs),
bag-filter: [x∈b|p[x]],
bag-map: bag-map(f;bs),
isl: isl(x),
empty-bag: {},
outr: outr(x)
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[X:EClass(A + B)]. (right(X) = \mlambda{}x.case x of inl(a) => \{\} | inr(b) => \{b\}[X])
Date html generated:
2016_05_17-AM-06_49_53
Last ObjectModification:
2016_01_17-PM-06_32_46
Theory : event-ordering
Home
Index