Nuprl Lemma : finite-subcover-implies-m-TB
∀[X:Type]
∀d:metric(X)
((∀[I:Type]. ∀[A:I ⟶ X ⟶ ℙ]. (m-open-cover(X;d;I;i,x.A[i;x]) ⇒ (∃n:ℕ+. ∃L:ℕn ⟶ I. ∀x:X. ∃j:ℕn. A[L j;x])))
⇒ m-TB(X;d))
Proof
Definitions occuring in Statement :
m-TB: m-TB(X;d),
m-open-cover: m-open-cover(X;d;I;i,x.A[i; x]),
metric: metric(X),
int_seg: {i..j-},
nat_plus: ℕ+,
uall: ∀[x:A]. B[x],
prop: ℙ,
so_apply: x[s1;s2],
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
implies: P ⇒ Q,
apply: f a,
function: x:A ⟶ B[x],
natural_number: $n,
universe: Type
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
iff: P ⇐⇒ Q,
and: P ∧ Q,
rev_implies: P ⇐ Q,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
exists: ∃x:A. B[x],
nat_plus: ℕ+,
subtype_rel: A ⊆r B,
nat: ℕ,
uimplies: b supposing a,
not: ¬A,
ge: i ≥ j ,
satisfiable_int_formula: satisfiable_int_formula(fmla),
false: False,
so_lambda: λ2x.t[x],
so_apply: x[s],
int_seg: {i..j-},
lelt: i ≤ j < k,
le: A ≤ B,
less_than: a < b,
squash: ↓T,
rless: x < y,
sq_exists: ∃x:A [B[x]],
rev_uimplies: rev_uimplies(P;Q),
rge: x ≥ y,
guard: {T},
m-open-cover: m-open-cover(X;d;I;i,x.A[i; x]),
m-open: m-open(X;d;x.A[x]),
uiff: uiff(P;Q),
req_int_terms: t1 ≡ t2,
decidable: Dec(P),
or: P ∨ Q
Latex:
\mforall{}[X:Type]
\mforall{}d:metric(X)
((\mforall{}[I:Type]. \mforall{}[A:I {}\mrightarrow{} X {}\mrightarrow{} \mBbbP{}].
(m-open-cover(X;d;I;i,x.A[i;x]) {}\mRightarrow{} (\mexists{}n:\mBbbN{}\msupplus{}. \mexists{}L:\mBbbN{}n {}\mrightarrow{} I. \mforall{}x:X. \mexists{}j:\mBbbN{}n. A[L j;x])))
{}\mRightarrow{} m-TB(X;d))
Date html generated:
2020_05_20-PM-00_02_58
Last ObjectModification:
2020_01_12-PM-02_05_56
Theory : reals
Home
Index