Nuprl Lemma : fpf-join_wf
∀[A:Type]. ∀[B:A ─→ Type]. ∀[f,g:a:A fp-> B[a]]. ∀[eq:EqDecider(A)]. (f ⊕ g ∈ a:A fp-> B[a])
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
fpf-dom_wf,
subtype_rel_product,
list_wf,
l_member_wf,
top_wf,
subtype_rel_dep_function,
subtype_top,
set_wf,
bool_wf,
equal-wf-T-base,
assert_wf,
bnot_wf,
not_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot,
fpf-ap_wf,
member_append,
filter_wf5,
deq-member_wf,
assert-deq-member,
member_filter
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g:a:A fp-> B[a]]. \mforall{}[eq:EqDecider(A)]. (f \moplus{} g \mmember{} a:A fp-> B[a])
Date html generated:
2015_07_17-AM-09_18_59
Last ObjectModification:
2015_01_28-AM-07_50_18
Home
Index