Nuprl Lemma : fpf-cap-wf-univ
∀[A:Type]. ∀[f:a:A fp-> Type]. ∀[eq:EqDecider(A)]. ∀[x:A]. ∀[z:Type]. (f(x)?z ∈ Type)
Proof
Definitions occuring in Statement :
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fpf-cap: f(x)?z,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
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{}[f:a:A fp-> Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[x:A]. \mforall{}[z:Type]. (f(x)?z \mmember{} Type)
Date html generated:
2016_05_16-AM-11_04_51
Last ObjectModification:
2015_12_29-AM-09_13_27
Theory : event-ordering
Home
Index