Nuprl Lemma : fset-member_wf
∀[T:Type]. ∀[eq:EqDecider(T)]. ∀[a:T]. ∀[s:fset(T)]. (a ∈ s ∈ ℙ)
Proof
Definitions occuring in Statement :
fset-member: a ∈ s,
fset: fset(T),
deq: EqDecider(T),
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
fset-member: a ∈ s,
fset: fset(T),
quotient: x,y:A//B[x; y],
and: P ∧ Q,
uimplies: b supposing a,
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
prop: ℙ,
rev_implies: P ⇐ Q,
set-equal: set-equal(T;x;y),
all: ∀x:A. B[x],
guard: {T}
Lemmas referenced :
assert_wf,
fset_wf,
deq_wf,
bool_wf,
iff_imp_equal_bool,
deq-member_wf,
l_member_wf,
assert-deq-member,
iff_wf,
equal-wf-base,
list_wf,
set-equal_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
lemma_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
hypothesis,
sqequalRule,
axiomEquality,
equalityTransitivity,
equalitySymmetry,
hypothesisEquality,
isect_memberEquality,
because_Cache,
universeEquality,
pointwiseFunctionalityForEquality,
pertypeElimination,
productElimination,
independent_isectElimination,
independent_pairFormation,
lambdaFormation,
dependent_functionElimination,
independent_functionElimination,
addLevel,
impliesFunctionality,
productEquality,
cumulativity
Latex:
\mforall{}[T:Type]. \mforall{}[eq:EqDecider(T)]. \mforall{}[a:T]. \mforall{}[s:fset(T)]. (a \mmember{} s \mmember{} \mBbbP{})
Date html generated:
2016_05_14-PM-03_38_05
Last ObjectModification:
2015_12_26-PM-06_42_27
Theory : finite!sets
Home
Index