Nuprl Lemma : fpf-empty-compatible-right
∀[A:Type]. ∀[eq:EqDecider(A)]. ∀[B:Top]. ∀[f:a:A fp-> Top]. f || ⊗
Proof
Definitions occuring in Statement :
fpf-compatible: f || g,
fpf-empty: ⊗,
fpf: a:A fp-> B[a],
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
top: Top,
so_apply: x[s],
universe: Type
Definitions unfolded in proof :
fpf-compatible: f || g,
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
fpf-empty: ⊗,
fpf-dom: x ∈ dom(f),
pi1: fst(t),
member: t ∈ T,
top: Top,
assert: ↑b,
ifthenelse: if b then t else f fi ,
bfalse: ff,
false: False,
prop: ℙ,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s]
Lemmas referenced :
deq_member_nil_lemma,
and_wf,
assert_wf,
fpf-dom_wf,
fpf-empty_wf,
top_wf,
fpf_wf,
deq_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
sqequalHypSubstitution,
productElimination,
thin,
sqequalRule,
lemma_by_obid,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isectElimination,
hypothesisEquality,
lambdaEquality,
because_Cache,
universeEquality,
isect_memberFormation,
introduction,
axiomEquality
Latex:
\mforall{}[A:Type]. \mforall{}[eq:EqDecider(A)]. \mforall{}[B:Top]. \mforall{}[f:a:A fp-> Top]. f || \motimes{}
Date html generated:
2018_05_21-PM-09_30_33
Last ObjectModification:
2018_02_09-AM-10_25_06
Theory : finite!partial!functions
Home
Index