Nuprl Lemma : fpf-contains_wf
∀[A:Type]. ∀[B:A ⟶ Type]. ∀[eq:EqDecider(A)]. ∀[f,g:a:A fp-> B[a] List]. (f ⊆⊆ g ∈ ℙ)
Proof
Definitions occuring in Statement :
fpf-contains: f ⊆⊆ g,
fpf: a:A fp-> B[a],
list: T List,
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
fpf-contains: f ⊆⊆ g,
uall: ∀[x:A]. B[x],
member: t ∈ T,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
prop: ℙ,
subtype_rel: A ⊆r B,
so_apply: x[s],
uimplies: b supposing a,
all: ∀x:A. B[x],
top: Top,
cand: A c∧ B
Lemmas referenced :
all_wf,
assert_wf,
fpf-dom_wf,
subtype-fpf2,
list_wf,
top_wf,
l_contains_wf,
fpf-ap_wf,
fpf_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
lambdaEquality,
functionEquality,
because_Cache,
applyEquality,
hypothesis,
independent_isectElimination,
lambdaFormation,
isect_memberEquality,
voidElimination,
voidEquality,
productEquality,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[A:Type]. \mforall{}[B:A {}\mrightarrow{} Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[f,g:a:A fp-> B[a] List]. (f \msubseteq{}\msubseteq{} g \mmember{} \mBbbP{})
Date html generated:
2018_05_21-PM-09_19_12
Last ObjectModification:
2018_02_09-AM-10_17_28
Theory : finite!partial!functions
Home
Index