Nuprl Lemma : fpf-join-empty
∀[A:Type]. ∀[B:A ─→ Type]. ∀[f:a:A fp-> B[a]]. ∀[eq:EqDecider(A)]. (⊗ ⊕ f = f ∈ a:A fp-> B[a])
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-empty: ⊗,
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,
equal: s = t ∈ T
Lemmas :
fpf_ap_pair_lemma,
list_ind_nil_lemma,
deq_member_nil_lemma,
subtype_rel_sets,
l_member_wf,
filter_wf5,
btrue_wf,
member_filter_2,
set_wf,
deq_wf,
fpf_wf,
filter_tt,
subtype_rel_list,
top_wf,
list_wf
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f:a:A fp-> B[a]]. \mforall{}[eq:EqDecider(A)]. (\motimes{} \moplus{} f = f)
Date html generated:
2015_07_17-AM-09_19_04
Last ObjectModification:
2015_01_28-AM-07_49_06
Home
Index