Nuprl Lemma : mset_inj_wf
∀s:DSet. ∀x:|s|. (mset_inj{s}(x) ∈ MSet{s})
Proof
Definitions occuring in Statement :
mset_inj: mset_inj{s}(x),
mset: MSet{s},
all: ∀x:A. B[x],
member: t ∈ T,
dset: DSet,
set_car: |p|
Definitions unfolded in proof :
all: ∀x:A. B[x],
member: t ∈ T,
uall: ∀[x:A]. B[x],
dset: DSet,
mset_inj: mset_inj{s}(x)
Lemmas referenced :
set_car_wf,
dset_wf,
mk_mset_wf,
cons_wf,
nil_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation,
cut,
sqequalHypSubstitution,
hypothesis,
lemma_by_obid,
isectElimination,
thin,
setElimination,
rename,
hypothesisEquality,
dependent_functionElimination
Latex:
\mforall{}s:DSet. \mforall{}x:|s|. (mset\_inj\{s\}(x) \mmember{} MSet\{s\})
Date html generated:
2016_05_16-AM-07_46_37
Last ObjectModification:
2015_12_28-PM-06_03_46
Theory : mset
Home
Index