Nuprl Lemma : null-bag
∀[T:Type]. ∀[x:bag(T)]. uiff(↑null(x);x = {} ∈ bag(T))
Proof
Definitions occuring in Statement :
empty-bag: {},
bag: bag(T),
null: null(as),
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
bag-null: bag-null(bs)
Lemmas referenced :
assert-bag-null
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
cut,
lemma_by_obid,
hypothesis
Latex:
\mforall{}[T:Type]. \mforall{}[x:bag(T)]. uiff(\muparrow{}null(x);x = \{\})
Date html generated:
2016_05_15-PM-02_25_14
Last ObjectModification:
2015_12_27-AM-09_53_10
Theory : bags
Home
Index