Nuprl Lemma : fpf-sub-join-left
∀[A:Type]. ∀[B1,B2:A ─→ Type]. ∀[eq:EqDecider(A)]. ∀[f:a:A fp-> B1[a]]. ∀[g:a:A fp-> Top]. f ⊆ f ⊕ g
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
function: x:A ─→ B[x],
universe: Type
Lemmas :
fpf-join-dom,
top_wf,
subtype-fpf2,
subtype_top,
assert_wf,
fpf-dom_wf,
fpf-ap_wf,
fpf-join-ap-left,
iff_weakening_equal,
assert_witness,
fpf-join_wf,
fpf_wf,
deq_wf
\mforall{}[A:Type]. \mforall{}[B1,B2:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f:a:A fp-> B1[a]]. \mforall{}[g:a:A fp-> Top].
f \msubseteq{} f \moplus{} g
Date html generated:
2015_07_17-AM-09_20_28
Last ObjectModification:
2015_02_04-PM-05_06_59
Home
Index