Nuprl Lemma : fpf-empty-compatible-right
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:Top]. ∀[f:a:A fp-> Top]. f || ⊗
Proof
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
universe: Type
Definitions unfolded in proof :
fpf-compatible: f || g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
fpf-empty: ⊗,
fpf-dom: x ∈ dom(f),
pi1: fst(t),
member: t ∈ T,
top: Top,
assert: ↑b,
ifthenelse: if b then t else f fi ,
bfalse: ff,
false: False,
prop: ℙ,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s]
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:Top]. \mforall{}[f:a:A fp-> Top]. f || \motimes{}
Date html generated:
2016_05_16-AM-11_32_23
Last ObjectModification:
2015_12_29-AM-09_27_59
Theory : event-ordering
Home
Index