Nuprl Lemma : fpf-compatible-update
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:A ⟶ Type]. ∀[f,g:a:A fp-> B[a]]. f ⊕ g || f
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-compatible: f || g,
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
Definitions unfolded in proof :
and: P ∧ Q,
member: t ∈ T,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
prop: ℙ,
fpf-compatible: f || g,
implies: P ⇒ Q,
squash: ↓T,
true: True,
guard: {T},
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Lemmas referenced :
assert_wf,
fpf-dom_wf,
fpf-join_wf,
top_wf,
subtype-fpf2,
fpf_wf,
deq_wf,
equal_wf,
squash_wf,
true_wf,
fpf-join-ap-left,
fpf-ap_wf,
iff_weakening_equal
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
productEquality,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
because_Cache,
sqequalRule,
lambdaEquality,
hypothesis,
applyEquality,
functionExtensionality,
independent_isectElimination,
lambdaFormation,
isect_memberEquality,
voidElimination,
voidEquality,
functionEquality,
universeEquality,
isect_memberFormation,
dependent_functionElimination,
axiomEquality,
productElimination,
imageElimination,
equalityTransitivity,
equalitySymmetry,
natural_numberEquality,
imageMemberEquality,
baseClosed,
independent_functionElimination
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[f,g:a:A fp-> B[a]]. f \moplus{} g || f
Date html generated:
2018_05_21-PM-09_28_38
Last ObjectModification:
2018_02_09-AM-10_23_51
Theory : finite!partial!functions
Home
Index