Nuprl Lemma : fpf-sub-join-left2
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,h,g:a:A fp-> B[a]]. h ⊆ f ⊕ g supposing h ⊆ f
Proof
Definitions occuring in Statement :
fpf-join: f ⊕ g,
fpf-sub: f ⊆ g,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
so_apply: x[s],
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
top: Top,
implies: P ⇒ Q,
prop: ℙ
Lemmas referenced :
fpf-sub_transitivity,
fpf-join_wf,
fpf-sub-join-left,
subtype-fpf2,
top_wf,
fpf-sub_witness,
fpf-sub_wf,
fpf_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
sqequalRule,
lambdaEquality,
applyEquality,
hypothesis,
independent_isectElimination,
because_Cache,
lambdaFormation,
isect_memberEquality,
voidElimination,
voidEquality,
independent_functionElimination,
equalityTransitivity,
equalitySymmetry,
functionEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,h,g:a:A fp-> B[a]]. h \msubseteq{} f \moplus{} g supposing h \msubseteq{} f
Date html generated:
2018_05_21-PM-09_22_13
Last ObjectModification:
2018_02_09-AM-10_18_37
Theory : finite!partial!functions
Home
Index