Nuprl Lemma : fpf-cap-void-subtype
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[ds:x:A fp-> Type]. ∀[x:A]. (ds(x)?Void ⊆r ds(x)?Top)
Proof
Definitions occuring in Statement :
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
top: Top,
void: Void,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-cap: f(x)?z,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
uiff: uiff(P;Q),
and: P ∧ Q,
ifthenelse: if b then t else f fi ,
bfalse: ff
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[ds:x:A fp-> Type]. \mforall{}[x:A]. (ds(x)?Void \msubseteq{}r ds(x)?Top)
Date html generated:
2016_05_16-AM-11_07_37
Last ObjectModification:
2015_12_29-AM-09_15_20
Theory : event-ordering
Home
Index