Nuprl Lemma : single-valued-bag-sv-list
∀[A:Type]. ∀[bs:bag(A)]. single-valued-list(bs;A) supposing single-valued-bag(bs;A)
Proof
Definitions occuring in Statement :
single-valued-list: single-valued-list(L;T),
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
single-valued-bag: single-valued-bag(b;T),
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
single-valued-list: single-valued-list(L;T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
single-valued-bag: single-valued-bag(b;T),
bag-member: x ↓∈ bs,
exists: ∃x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
subtype_rel: A ⊆r B,
squash: ↓T
Latex:
\mforall{}[A:Type]. \mforall{}[bs:bag(A)]. single-valued-list(bs;A) supposing single-valued-bag(bs;A)
Date html generated:
2016_05_17-AM-11_10_41
Last ObjectModification:
2016_01_18-AM-00_09_22
Theory : process-model
Home
Index