Nuprl Lemma : fpf-union_wf
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:x:A fp-> B[x] List]. ∀[x:A]. ∀[R:⋂a:A. ((B[a] List) ⟶ B[a] ⟶ 𝔹)].
(fpf-union(f;g;eq;R;x) ∈ B[x] List)
Proof
Definitions occuring in Statement :
fpf-union: fpf-union(f;g;eq;R;x),
fpf: a:A fp-> B[a],
list: T List,
deq: EqDecider(T),
bool: 𝔹,
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
isect: ⋂x:A. B[x],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-union: fpf-union(f;g;eq;R;x),
fpf-cap: f(x)?z,
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
bfalse: ff,
prop: ℙ,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
false: False,
bnot: ¬bb,
not: ¬A,
cand: A c∧ B
Lemmas referenced :
fpf-dom_wf,
subtype-fpf2,
list_wf,
top_wf,
bool_wf,
eqtt_to_assert,
equal_wf,
bool_cases_sqequal,
subtype_base_sq,
bool_subtype_base,
append_wf,
fpf-ap_wf,
filter_wf5,
subtype_rel_dep_function,
l_member_wf,
subtype_rel_self,
set_wf,
eqff_to_assert,
assert-bnot,
assert_of_band,
assert_wf,
nil_wf,
fpf_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
applyEquality,
lambdaEquality,
functionExtensionality,
hypothesis,
independent_isectElimination,
lambdaFormation,
isect_memberEquality,
voidElimination,
voidEquality,
because_Cache,
unionElimination,
equalityElimination,
productElimination,
equalityTransitivity,
equalitySymmetry,
dependent_functionElimination,
independent_functionElimination,
dependent_pairFormation,
promote_hyp,
instantiate,
setEquality,
setElimination,
rename,
productEquality,
axiomEquality,
isectEquality,
functionEquality,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:x:A fp-> B[x] List]. \mforall{}[x:A]. \mforall{}[R:\mcap{}a:A
((B[a] List)
{}\mrightarrow{} B[a]
{}\mrightarrow{} \mBbbB{})].
(fpf-union(f;g;eq;R;x) \mmember{} B[x] List)
Date html generated:
2018_05_21-PM-09_18_10
Last ObjectModification:
2018_02_09-AM-10_17_01
Theory : finite!partial!functions
Home
Index