Nuprl Lemma : cons_bag_empty_lemma
∀x:Top. (x.{} ~ {x})
Proof
Definitions occuring in Statement :
cons-bag: x.b,
single-bag: {x},
empty-bag: {},
top: Top,
all: ∀x:A. B[x],
sqequal: s ~ t
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
empty-bag: {},
cons-bag: x.b,
single-bag: {x}
Lemmas referenced :
top_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
hypothesis,
lemma_by_obid,
sqequalRule
Latex:
\mforall{}x:Top. (x.\{\} \msim{} \{x\})
Date html generated:
2016_05_15-PM-02_21_53
Last ObjectModification:
2015_12_27-AM-09_55_13
Theory : bags
Home
Index