Nuprl Lemma : bag-member-empty-iff
∀[T:Type]. ∀[x:T]. uiff(x ↓∈ {};False)
Proof
Definitions occuring in Statement :
bag-member: x ↓∈ bs,
empty-bag: {},
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
false: False,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
false: False,
prop: ℙ,
bag-member: x ↓∈ bs,
squash: ↓T
Lemmas referenced :
false_wf,
empty-bag_wf,
bag-member_wf,
bag-member-empty
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
independent_pairFormation,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
because_Cache,
hypothesisEquality,
independent_isectElimination,
hypothesis,
voidElimination,
sqequalRule,
imageElimination,
imageMemberEquality,
baseClosed,
productElimination,
independent_pairEquality,
isect_memberEquality,
equalityTransitivity,
equalitySymmetry,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[x:T]. uiff(x \mdownarrow{}\mmember{} \{\};False)
Date html generated:
2016_05_15-PM-02_36_53
Last ObjectModification:
2016_01_16-AM-08_50_25
Theory : bags
Home
Index