Nuprl Lemma : filter-sq
∀[T:Type]. ∀[L:T List]. ∀[P,Q:{x:T| (x ∈ L)} ⟶ 𝔹].
filter(P;L) ~ filter(Q;L) supposing ∀x:{x:T| (x ∈ L)} . (↑(P x) ⇐⇒ ↑(Q x))
Proof
Definitions occuring in Statement :
l_member: (x ∈ l),
filter: filter(P;l),
list: T List,
assert: ↑b,
bool: 𝔹,
uimplies: b supposing a,
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
set: {x:A| B[x]} ,
apply: f a,
function: x:A ⟶ B[x],
universe: Type,
sqequal: s ~ t
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
all: ∀x:A. B[x],
nat: ℕ,
implies: P ⇒ Q,
false: False,
ge: i ≥ j ,
uimplies: b supposing a,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
so_apply: x[s],
subtype_rel: A ⊆r B,
guard: {T},
or: P ∨ Q,
cons: [a / b],
colength: colength(L),
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable: Dec(P),
nil: [],
it: ⋅,
sq_type: SQType(T),
less_than: a < b,
squash: ↓T,
less_than': less_than'(a;b),
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
bool: 𝔹,
unit: Unit,
btrue: tt,
uiff: uiff(P;Q),
ifthenelse: if b then t else f fi ,
bfalse: ff
Lemmas referenced :
nat_properties,
satisfiable-full-omega-tt,
intformand_wf,
intformle_wf,
itermConstant_wf,
itermVar_wf,
intformless_wf,
int_formula_prop_and_lemma,
int_formula_prop_le_lemma,
int_term_value_constant_lemma,
int_term_value_var_lemma,
int_formula_prop_less_lemma,
int_formula_prop_wf,
ge_wf,
less_than_wf,
all_wf,
l_member_wf,
iff_wf,
assert_wf,
bool_wf,
equal-wf-T-base,
nat_wf,
colength_wf_list,
less_than_transitivity1,
less_than_irreflexivity,
list-cases,
filter_nil_lemma,
nil_wf,
product_subtype_list,
spread_cons_lemma,
intformeq_wf,
itermAdd_wf,
int_formula_prop_eq_lemma,
int_term_value_add_lemma,
decidable__le,
intformnot_wf,
int_formula_prop_not_lemma,
le_wf,
equal_wf,
subtract_wf,
itermSubtract_wf,
int_term_value_subtract_lemma,
subtype_base_sq,
set_subtype_base,
int_subtype_base,
decidable__equal_int,
filter_cons_lemma,
cons_wf,
list_wf,
cons_member,
subtype_rel_dep_function,
subtype_rel_sets,
subtype_rel_self,
set_wf,
bnot_wf,
not_wf,
eqtt_to_assert,
uiff_transitivity,
eqff_to_assert,
assert_of_bnot
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
introduction,
cut,
thin,
lambdaFormation,
extract_by_obid,
sqequalHypSubstitution,
isectElimination,
hypothesisEquality,
hypothesis,
setElimination,
rename,
intWeakElimination,
natural_numberEquality,
independent_isectElimination,
dependent_pairFormation,
lambdaEquality,
int_eqEquality,
intEquality,
dependent_functionElimination,
isect_memberEquality,
voidElimination,
voidEquality,
sqequalRule,
independent_pairFormation,
computeAll,
independent_functionElimination,
sqequalAxiom,
setEquality,
cumulativity,
applyEquality,
functionExtensionality,
dependent_set_memberEquality,
because_Cache,
equalityTransitivity,
equalitySymmetry,
functionEquality,
unionElimination,
promote_hyp,
hypothesis_subsumption,
productElimination,
applyLambdaEquality,
addEquality,
baseClosed,
instantiate,
imageElimination,
universeEquality,
inlFormation,
inrFormation,
equalityElimination
Latex:
\mforall{}[T:Type]. \mforall{}[L:T List]. \mforall{}[P,Q:\{x:T| (x \mmember{} L)\} {}\mrightarrow{} \mBbbB{}].
filter(P;L) \msim{} filter(Q;L) supposing \mforall{}x:\{x:T| (x \mmember{} L)\} . (\muparrow{}(P x) \mLeftarrow{}{}\mRightarrow{} \muparrow{}(Q x))
Date html generated:
2017_04_17-AM-08_35_52
Last ObjectModification:
2017_02_27-PM-04_55_40
Theory : list_1
Home
Index