Nuprl Lemma : subtype-fpf-cap-void-list
∀[X:Type]. ∀[eq:EqDecider(X)]. ∀[f,g:x:X fp-> Type]. ∀[x:X]. (f(x)?Void List) ⊆r (g(x)?Void List) supposing f ⊆ g
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf-cap: f(x)?z,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
list: T List,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
void: Void,
universe: Type
Lemmas :
subtype_rel_list,
fpf-cap_wf,
subtype-fpf-cap-void,
fpf-sub_wf,
fpf_wf,
deq_wf
\mforall{}[X:Type]. \mforall{}[eq:EqDecider(X)]. \mforall{}[f,g:x:X fp-> Type]. \mforall{}[x:X].
(f(x)?Void List) \msubseteq{}r (g(x)?Void List) supposing f \msubseteq{} g
Date html generated:
2015_07_17-AM-09_18_50
Last ObjectModification:
2015_01_28-AM-07_49_23
Home
Index