Nuprl Lemma : subtype-fpf
∀[A:Type]. ∀[P:A ⟶ ℙ]. ∀[B:A ⟶ Type]. (a:{a:A| P[a]} fp-> B[a] ⊆r a:A fp-> B[a])
Proof
Definitions occuring in Statement :
fpf: a:A fp-> B[a],
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type
Latex:
\mforall{}[A:Type]. \mforall{}[P:A {}\mrightarrow{} \mBbbP{}]. \mforall{}[B:A {}\mrightarrow{} Type]. (a:\{a:A| P[a]\} fp-> B[a] \msubseteq{}r a:A fp-> B[a])
Date html generated:
2016_05_16-AM-11_02_47
Last ObjectModification:
2015_12_29-AM-09_11_51
Theory : event-ordering
Home
Index