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
Lemmas :
subtype-fpf2,
top_wf,
subtype_top,
fpf_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. (f \mmember{} a:A fp-> Top)
Date html generated:
2015_07_17-AM-09_15_49
Last ObjectModification:
2015_01_28-AM-07_52_27
Home
Index