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]
, 
list: T List
, 
deq: EqDecider(T)
, 
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
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
uimplies: b supposing a
, 
fpf-union-compatible: fpf-union-compatible(A;C;x.B[x];eq;R;f;g)
, 
so_apply: x[s]
, 
so_lambda: λ2x.t[x]
, 
implies: P 
⇒ Q
, 
prop: ℙ
, 
subtype_rel: A ⊆r B
, 
all: ∀x:A. B[x]
, 
top: Top
, 
and: P ∧ Q
, 
or: P ∨ Q
, 
exists: ∃x:A. B[x]
Lemmas referenced : 
all_wf, 
assert_wf, 
fpf-dom_wf, 
subtype-fpf2, 
list_wf, 
top_wf, 
or_wf, 
l_member_wf, 
fpf-ap_wf, 
subtype_rel_list, 
not_wf, 
exists_wf, 
equal_wf, 
bool_wf, 
fpf_wf, 
deq_wf, 
subtype_rel_wf
Rules used in proof : 
sqequalSubstitution, 
sqequalTransitivity, 
computationStep, 
sqequalReflexivity, 
isect_memberFormation, 
introduction, 
cut, 
sqequalHypSubstitution, 
sqequalRule, 
extract_by_obid, 
isectElimination, 
thin, 
cumulativity, 
hypothesisEquality, 
lambdaEquality, 
functionEquality, 
because_Cache, 
applyEquality, 
functionExtensionality, 
hypothesis, 
independent_isectElimination, 
lambdaFormation, 
isect_memberEquality, 
voidElimination, 
voidEquality, 
productEquality, 
dependent_functionElimination, 
axiomEquality, 
equalityTransitivity, 
equalitySymmetry, 
universeEquality
Latex:
\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:
2018_05_21-PM-09_18_17
Last ObjectModification:
2018_02_09-AM-10_17_03
Theory : finite!partial!functions
Home
Index