Nuprl Definition : wqo-less
wqo-less(T;x,y.R[x; y];bs;as) ==
∃a:T. let m,s' = bs in let n,s = as in (m = (n + 1) ∈ ℤ) ∧ (s' = s.s' n@n ∈ (ℕm ⟶ T)) ∧ (∀i:ℕn. (¬R[s i; s' n]))
Definitions occuring in Statement :
seq-add: s.x@n,
int_seg: {i..j-},
all: ∀x:A. B[x],
exists: ∃x:A. B[x],
not: ¬A,
and: P ∧ Q,
apply: f a,
function: x:A ⟶ B[x],
spread: spread def,
add: n + m,
natural_number: $n,
int: ℤ,
equal: s = t ∈ T
Definitions occuring in definition :
exists: ∃x:A. B[x],
spread: spread def,
int: ℤ,
add: n + m,
and: P ∧ Q,
equal: s = t ∈ T,
function: x:A ⟶ B[x],
seq-add: s.x@n,
all: ∀x:A. B[x],
int_seg: {i..j-},
natural_number: $n,
not: ¬A,
apply: f a
FDL editor aliases :
wqo-less
Latex:
wqo-less(T;x,y.R[x; y];bs;as) ==
\mexists{}a:T. let m,s' = bs in let n,s = as in (m = (n + 1)) \mwedge{} (s' = s.s' n@n) \mwedge{} (\mforall{}i:\mBbbN{}n. (\mneg{}R[s i; s' n]))
Date html generated:
2016_05_13-PM-03_53_09
Last ObjectModification:
2015_09_22-PM-05_45_28
Theory : bar-induction
Home
Index