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
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
uall: ∀[x:A]. B[x],
so_lambda: λ2x.t[x],
so_apply: x[s],
uimplies: b supposing a,
iff: P ⇐⇒ Q,
ge: i ≥ j ,
rev_implies: P ⇐ Q,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
subtract: n - m,
sq_type: SQType(T),
guard: {T},
two-intersection: two-intersection(A;W),
n-intersecting: n-intersecting(A;T;n),
cand: A c∧ B,
combination: Combination(n;T),
length: ||as||,
list_ind: list_ind,
cons: [a / b],
nil: [],
it: ⋅
Latex:
\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:
2016_05_16-PM-00_01_47
Last ObjectModification:
2016_01_17-PM-03_54_46
Theory : event-ordering
Home
Index