Nuprl Lemma : single-valued-list-sv-bag
∀[A:Type]. ∀[L:A List]. single-valued-bag(L;A) supposing single-valued-list(L;A)
Proof
Definitions occuring in Statement :
single-valued-list: single-valued-list(L;T),
list: T List,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
universe: Type,
single-valued-bag: single-valued-bag(b;T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
single-valued-bag: single-valued-bag(b;T),
all: ∀x:A. B[x],
implies: P ⇒ Q,
single-valued-list: single-valued-list(L;T),
prop: ℙ,
subtype_rel: A ⊆r B,
iff: P ⇐⇒ Q,
and: P ∧ Q
Latex:
\mforall{}[A:Type]. \mforall{}[L:A List]. single-valued-bag(L;A) supposing single-valued-list(L;A)
Date html generated:
2016_05_17-AM-11_11_15
Last ObjectModification:
2015_12_29-PM-05_14_53
Theory : process-model
Home
Index