Nuprl Lemma : fpf-sub_weakening
∀[A:Type]. ∀[B:A ─→ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a]]. f ⊆ g supposing f = g ∈ a:A fp-> B[a]
Proof
Definitions occuring in Statement :
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type,
equal: s = t ∈ T
Lemmas :
fpf-sub_wf,
fpf-sub_witness,
equal_wf,
fpf_wf,
deq_wf,
fpf-ap_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a]]. f \msubseteq{} g supposing f = g
Date html generated:
2015_07_17-AM-09_17_40
Last ObjectModification:
2015_01_28-AM-07_51_08
Home
Index