Nuprl Lemma : bag-append-empty
∀[as:Top List]. (as + {} ~ as)
Proof
Definitions occuring in Statement :
bag-append: as + bs,
empty-bag: {},
list: T List,
uall: ∀[x:A]. B[x],
top: Top,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
empty-bag: {},
bag-append: as + bs
Lemmas referenced :
append-nil,
list_wf,
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
sqequalRule,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesisEquality,
hypothesis,
sqequalAxiom
Latex:
\mforall{}[as:Top List]. (as + \{\} \msim{} as)
Date html generated:
2016_05_15-PM-02_22_19
Last ObjectModification:
2015_12_27-AM-09_54_55
Theory : bags
Home
Index