Nuprl Lemma : simple-comb1_wf
∀[Info,A,B:Type]. ∀[F:bag(A) ⟶ bag(B)]. ∀[X:EClass(A)]. (λx.F[x]|X| ∈ EClass(B))
Proof
Definitions occuring in Statement :
simple-comb1: λx.F[x]|X|,
eclass: EClass(A[eo; e]),
uall: ∀[x:A]. B[x],
so_apply: x[s],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
simple-comb1: λx.F[x]|X|,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
so_lambda: λ2x.t[x],
int_seg: {i..j-},
uimplies: b supposing a,
guard: {T},
lelt: i ≤ j < k,
all: ∀x:A. B[x],
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
so_apply: x[s],
less_than: a < b,
squash: ↓T,
true: True
Latex:
\mforall{}[Info,A,B:Type]. \mforall{}[F:bag(A) {}\mrightarrow{} bag(B)]. \mforall{}[X:EClass(A)]. (\mlambda{}x.F[x]|X| \mmember{} EClass(B))
Date html generated:
2016_05_17-AM-00_03_15
Last ObjectModification:
2016_01_17-PM-06_55_50
Theory : event-ordering
Home
Index