Nuprl Lemma : fpf-sub-reflexive
∀[A:Type]. ∀[B:A ─→ Type]. ∀[eq:EqDecider(A)]. ∀[f:a:A fp-> B[a]]. f ⊆ f
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
fpf-sub_witness,
fpf_wf,
deq_wf,
fpf-sub_weakening
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f:a:A fp-> B[a]]. f \msubseteq{} f
Date html generated:
2015_07_17-AM-11_11_49
Last ObjectModification:
2015_01_28-AM-07_42_51
Home
Index