Nuprl Lemma : l_member_type2
∀[T:Type]. ∀x:T. ∀[P:T ⟶ ℙ]. ∀d:{i:T| P[i]} List. ((∀y:T. Dec(P[y])) ⇒ (x ∈ d) ⇒ P[x])
Proof
Definitions occuring in Statement :
l_member: (x ∈ l),
list: T List,
decidable: Dec(P),
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
set: {x:A| B[x]} ,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
so_apply: x[s],
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
prop: ℙ,
subtype_rel: A ⊆r B,
uimplies: b supposing a,
so_lambda: λ2x.t[x],
decidable: Dec(P),
or: P ∨ Q,
l_member: (x ∈ l),
exists: ∃x:A. B[x],
cand: A c∧ B,
nat: ℕ,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
not: ¬A,
top: Top,
and: P ∧ Q,
squash: ↓T
Lemmas referenced :
l_member_wf,
subtype_rel_list,
all_wf,
decidable_wf,
list_wf,
select_wf,
nat_properties,
decidable__le,
satisfiable-full-omega-tt,
intformand_wf,
intformnot_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
int_formula_prop_and_lemma,
int_formula_prop_not_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_wf,
set_wf
Rules used in proof :
sqequalSubstitution,
sqequalRule,
sqequalReflexivity,
sqequalTransitivity,
computationStep,
isect_memberFormation,
lambdaFormation,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
thin,
cumulativity,
hypothesisEquality,
applyEquality,
setEquality,
functionExtensionality,
hypothesis,
lambdaEquality,
universeEquality,
independent_isectElimination,
setElimination,
rename,
because_Cache,
functionEquality,
dependent_functionElimination,
unionElimination,
productElimination,
natural_numberEquality,
dependent_pairFormation,
int_eqEquality,
intEquality,
isect_memberEquality,
voidElimination,
voidEquality,
independent_pairFormation,
computeAll,
equalityTransitivity,
equalitySymmetry,
imageMemberEquality,
baseClosed,
imageElimination,
independent_functionElimination,
hyp_replacement,
Error :applyLambdaEquality
Latex:
\mforall{}[T:Type]. \mforall{}x:T. \mforall{}[P:T {}\mrightarrow{} \mBbbP{}]. \mforall{}d:\{i:T| P[i]\} List. ((\mforall{}y:T. Dec(P[y])) {}\mRightarrow{} (x \mmember{} d) {}\mRightarrow{} P[x])
Date html generated:
2016_10_21-AM-10_03_12
Last ObjectModification:
2016_07_12-AM-05_24_06
Theory : list_1
Home
Index