Nuprl Lemma : fpf_join_nil_lemma
∀eq:Top. (⊕([]) ~ ⊗)
Proof
Definitions occuring in Statement :
fpf-join-list: ⊕(L),
fpf-empty: ⊗,
nil: [],
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
fpf-join-list: ⊕(L),
top: Top
Lemmas referenced :
top_wf,
reduce_nil_lemma
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality
Latex:
\mforall{}eq:Top. (\moplus{}([]) \msim{} \motimes{})
Date html generated:
2018_05_21-PM-09_23_10
Last ObjectModification:
2018_02_09-AM-10_19_08
Theory : finite!partial!functions
Home
Index