Nuprl Lemma : l-union-nil
∀[eq,as:Top]. (as ⋃ [] ~ as)
Proof
Definitions occuring in Statement :
l-union: as ⋃ bs,
nil: [],
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
l-union: as ⋃ bs,
all: ∀x:A. B[x],
member: t ∈ T,
top: Top,
uall: ∀[x:A]. B[x]
Lemmas referenced :
reduce_nil_lemma,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
isect_memberEquality,
voidElimination,
voidEquality,
hypothesis,
isect_memberFormation,
introduction,
sqequalAxiom,
isectElimination,
hypothesisEquality,
because_Cache
Latex:
\mforall{}[eq,as:Top]. (as \mcup{} [] \msim{} as)
Date html generated:
2016_05_14-PM-03_24_32
Last ObjectModification:
2015_12_26-PM-06_21_47
Theory : decidable!equality
Home
Index