Nuprl Lemma : disj_un_tr_ap_inl_lemma
∀x,i,tr2,tr1:Top. (tr1 + tr2 i (inl x) ~ λs.(tr1 i x s))
Proof
Definitions occuring in Statement :
disjoint-union-tr: tr1 + tr2,
top: Top,
all: ∀x:A. B[x],
apply: f a,
lambda: λx.A[x],
inl: inl x,
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
disjoint-union-tr: tr1 + tr2,
isl: isl(x),
outl: outl(x),
outr: outr(x),
ifthenelse: if b then t else f fi ,
btrue: tt
Latex:
\mforall{}x,i,tr2,tr1:Top. (tr1 + tr2 i (inl x) \msim{} \mlambda{}s.(tr1 i x s))
Date html generated:
2016_05_17-AM-09_26_51
Last ObjectModification:
2015_12_29-PM-04_03_26
Theory : classrel!lemmas
Home
Index