Nuprl Lemma : three-intersecting-wait-set-exists
∀t:ℕ. ∀A:Id List.
(∃W:{a:Id| (a ∈ A)} List List
((∀ws:{a:Id| (a ∈ A)} List. ((ws ∈ W) ⇐⇒ (||ws|| = ((2 * t) + 1) ∈ ℤ) ∧ no_repeats({a:Id| (a ∈ A)} ;ws)))
∧ three-intersection(A;W))) supposing
(no_repeats(Id;A) and
(||A|| = ((3 * t) + 1) ∈ ℤ))
Proof
Definitions occuring in Statement :
three-intersection: three-intersection(A;W),
Id: Id,
no_repeats: no_repeats(T;l),
l_member: (x ∈ l),
length: ||as||,
list: T List,
nat: ℕ,
uimplies: b supposing a,
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
iff: 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],
uimplies: b supposing a,
member: t ∈ T,
uall: ∀[x:A]. B[x],
implies: P ⇒ Q,
nat: ℕ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
false: False,
not: ¬A,
top: Top,
and: P ∧ Q,
prop: ℙ,
cand: A c∧ B,
so_lambda: λ2x.t[x],
so_apply: x[s],
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q
Latex:
\mforall{}t:\mBbbN{}. \mforall{}A:Id List.
(\mexists{}W:\{a:Id| (a \mmember{} A)\} List List
((\mforall{}ws:\{a:Id| (a \mmember{} A)\} List. ((ws \mmember{} W) \mLeftarrow{}{}\mRightarrow{} (||ws|| = ((2 * t) + 1)) \mwedge{} no\_repeats(\{a:Id| (a \mmember{} A)\}\000C ;ws)))
\mwedge{} three-intersection(A;W))) supposing
(no\_repeats(Id;A) and
(||A|| = ((3 * t) + 1)))
Date html generated:
2016_05_16-PM-00_01_57
Last ObjectModification:
2016_01_17-PM-03_54_08
Theory : event-ordering
Home
Index