Nuprl Lemma : fpf-trivial-subtype-top
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[f:a:A fp-> B[a]]. (f ∈ a:A fp-> Top)
Proof
Definitions occuring in Statement :
fpf: a:A fp-> B[a],
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
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
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. (f \mmember{} a:A fp-> Top)
Date html generated:
2016_05_16-AM-11_03_47
Last ObjectModification:
2015_12_29-AM-09_12_37
Theory : event-ordering
Home
Index