Nuprl Definition : upwd-closure
upwd-closure(T;A) == λas.∃bs:T List. (bs ≤ as ∧ (A bs))
Definitions occuring in Statement :
iseg: l1 ≤ l2,
list: T List,
exists: ∃x:A. B[x],
and: P ∧ Q,
apply: f a,
lambda: λx.A[x]
Definitions occuring in definition :
lambda: λx.A[x],
exists: ∃x:A. B[x],
list: T List,
and: P ∧ Q,
iseg: l1 ≤ l2,
apply: f a
FDL editor aliases :
upwd-closure
Latex:
upwd-closure(T;A) == \mlambda{}as.\mexists{}bs:T List. (bs \mleq{} as \mwedge{} (A bs))
Date html generated:
2016_05_14-PM-04_10_00
Last ObjectModification:
2015_09_22-PM-06_02_19
Theory : fan-theorem
Home
Index