Nuprl Lemma : l_all_implies_l_all_filter
∀[T:Type]. ∀[Q:T ⟶ ℙ]. ∀P:T ⟶ 𝔹. ∀L:T List. ((∀x∈L.Q[x]) ⇒ (∀x∈filter(P;L).Q[x]))
Proof
Definitions occuring in Statement :
l_all: (∀x∈L.P[x]),
filter: filter(P;l),
list: T List,
bool: 𝔹,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s],
all: ∀x:A. B[x],
implies: P ⇒ Q,
function: x:A ⟶ B[x],
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q,
member: t ∈ T,
prop: ℙ,
iff: P ⇐⇒ Q,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
rev_implies: P ⇐ Q,
guard: {T}
Lemmas referenced :
and_wf,
l_member_wf,
assert_wf,
member_filter,
filter_wf5,
subtype_rel_dep_function,
bool_wf,
subtype_rel_self,
set_wf,
l_all_iff,
all_wf,
l_all_wf,
list_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
isect_memberFormation,
lambdaFormation,
cut,
sqequalHypSubstitution,
productElimination,
thin,
lemma_by_obid,
isectElimination,
hypothesisEquality,
hypothesis,
applyEquality,
addLevel,
allFunctionality,
impliesFunctionality,
because_Cache,
dependent_functionElimination,
independent_functionElimination,
sqequalRule,
lambdaEquality,
setEquality,
independent_isectElimination,
setElimination,
rename,
levelHypothesis,
allLevelFunctionality,
impliesLevelFunctionality,
functionEquality,
cumulativity,
universeEquality
Latex:
\mforall{}[T:Type]. \mforall{}[Q:T {}\mrightarrow{} \mBbbP{}]. \mforall{}P:T {}\mrightarrow{} \mBbbB{}. \mforall{}L:T List. ((\mforall{}x\mmember{}L.Q[x]) {}\mRightarrow{} (\mforall{}x\mmember{}filter(P;L).Q[x]))
Date html generated:
2016_05_14-AM-06_52_22
Last ObjectModification:
2015_12_26-PM-00_21_37
Theory : list_0
Home
Index