Nuprl Lemma : fpf-union-compatible_wf
∀[A,C:Type]. ∀[B:A ─→ Type].
∀[eq:EqDecider(A)]. ∀[f,g:x:A fp-> B[x] List]. ∀[R:(C List) ─→ C ─→ 𝔹].
(fpf-union-compatible(A;C;x.B[x];eq;R;f;g) ∈ ℙ)
supposing ∀x:A. (B[x] ⊆r C)
Proof
Definitions occuring in Statement :
fpf-union-compatible: fpf-union-compatible(A;C;x.B[x];eq;R;f;g),
fpf: a:A fp-> B[a],
deq: EqDecider(T),
list: T List,
bool: 𝔹,
uimplies: b supposing a,
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
member: t ∈ T,
function: x:A ─→ B[x],
universe: Type
Lemmas :
all_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
top_wf,
subtype_top,
list_wf,
or_wf,
l_member_wf,
fpf-ap_wf,
subtype_rel_list,
not_wf,
exists_wf,
bool_wf,
fpf_wf,
deq_wf,
subtype_rel_wf
\mforall{}[A,C:Type]. \mforall{}[B:A {}\mrightarrow{} Type].
\mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:x:A fp-> B[x] List]. \mforall{}[R:(C List) {}\mrightarrow{} C {}\mrightarrow{} \mBbbB{}].
(fpf-union-compatible(A;C;x.B[x];eq;R;f;g) \mmember{} \mBbbP{})
supposing \mforall{}x:A. (B[x] \msubseteq{}r C)
Date html generated:
2015_07_17-AM-09_16_47
Last ObjectModification:
2015_01_28-AM-07_52_01
Home
Index