Nuprl Lemma : fpf-contains_self
∀[A:Type]. ∀[B:A ─→ Type]. ∀eq:EqDecider(A). ∀f:a:A fp-> B[a] List. f ⊆⊆ f
Proof
Definitions occuring in Statement :
fpf-contains: f ⊆⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
list: T List,
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
function: x:A ─→ B[x],
universe: Type
Lemmas :
l_contains_weakening,
fpf-ap_wf,
list_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}eq:EqDecider(A). \mforall{}f:a:A fp-> B[a] List. f \msubseteq{}\msubseteq{} f
Date html generated:
2015_07_17-AM-09_17_46
Last ObjectModification:
2015_01_28-AM-07_50_39
Home
Index