Nuprl Lemma : sv-bag-tail-single-valued
∀[A:Type]. ∀[bs:bag(A)].  (single-valued-bag(bs;A) 
⇒ 0 < #(bs) 
⇒ single-valued-bag(sv-bag-tail(bs);A))
Proof
Definitions occuring in Statement : 
sv-bag-tail: sv-bag-tail(bs)
, 
less_than: a < b
, 
uall: ∀[x:A]. B[x]
, 
implies: P 
⇒ Q
, 
natural_number: $n
, 
universe: Type
, 
single-valued-bag: single-valued-bag(b;T)
, 
bag-size: #(bs)
, 
bag: bag(T)
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
implies: P 
⇒ Q
, 
prop: ℙ
, 
subtype_rel: A ⊆r B
, 
nat: ℕ
, 
single-valued-bag: single-valued-bag(b;T)
, 
all: ∀x:A. B[x]
, 
uimplies: b supposing a
, 
bag-size: #(bs)
, 
sv-bag-tail: sv-bag-tail(bs)
Latex:
\mforall{}[A:Type].  \mforall{}[bs:bag(A)].
    (single-valued-bag(bs;A)  {}\mRightarrow{}  0  <  \#(bs)  {}\mRightarrow{}  single-valued-bag(sv-bag-tail(bs);A))
Date html generated:
2016_05_17-AM-11_11_22
Last ObjectModification:
2015_12_29-PM-05_14_41
Theory : process-model
Home
Index