Nuprl Lemma : two-intersecting-wait-set
∀t:ℕ. ∀A:Id List.
({a:Id| (a ∈ A)} ~ ℕ(2 * t) + 1
⇒ (∀W:{a:Id| (a ∈ A)} List List
((∀ws:{a:Id| (a ∈ A)} List. ((ws ∈ W) ⇐⇒ (||ws|| = (t + 1) ∈ ℤ) ∧ no_repeats({a:Id| (a ∈ A)} ;ws)))
⇒ two-intersection(A;W))))
Proof
Definitions occuring in Statement :
two-intersection: two-intersection(A;W),
equipollent: A ~ B,
Id: Id,
no_repeats: no_repeats(T;l),
l_member: (x ∈ l),
length: ||as||,
list: T List,
int_seg: {i..j-},
nat: ℕ,
all: ∀x:A. B[x],
iff: P ⇐⇒ Q,
implies: P ⇒ Q,
and: P ∧ Q,
set: {x:A| B[x]} ,
multiply: n * m,
add: n + m,
natural_number: $n,
int: ℤ,
equal: s = t ∈ T
Lemmas :
combinations-n-intersecting,
false_wf,
le_wf,
all_wf,
list_wf,
Id_wf,
l_member_wf,
iff_wf,
length_wf,
no_repeats_wf,
equipollent_wf,
int_seg_wf,
nat_wf,
subtype_base_sq,
int_subtype_base,
add-commutes,
mul-distributes-right,
add-associates,
add-swap,
one-mul,
cons_wf,
combination_wf,
subtract_wf,
nil_wf,
l_all_iff,
exists_wf,
l_all_wf2,
l_all_cons
\mforall{}t:\mBbbN{}. \mforall{}A:Id List.
(\{a:Id| (a \mmember{} A)\} \msim{} \mBbbN{}(2 * t) + 1
{}\mRightarrow{} (\mforall{}W:\{a:Id| (a \mmember{} A)\} List List
((\mforall{}ws:\{a:Id| (a \mmember{} A)\} List. ((ws \mmember{} W) \mLeftarrow{}{}\mRightarrow{} (||ws|| = (t + 1)) \mwedge{} no\_repeats(\{a:Id| (a \mmember{} A)\} ;\000Cws)))
{}\mRightarrow{} two-intersection(A;W))))
Date html generated:
2015_07_17-AM-11_29_06
Last ObjectModification:
2015_01_28-AM-01_37_44
Home
Index