Nuprl Lemma : rec-combined-class-opt-3_wf
∀[Info,A,B,C,D:Type]. ∀[F:bag(A) ⟶ bag(B) ⟶ bag(C) ⟶ bag(D) ⟶ bag(D)]. ∀[init:Id ⟶ bag(D)]. ∀[X:EClass(A)].
∀[Y:EClass(B)]. ∀[Z:EClass(C)].
(rec-combined-class-opt-3(F;init;X;Y;Z) ∈ EClass(D))
Proof
Definitions occuring in Statement :
rec-combined-class-opt-3: rec-combined-class-opt-3(F;init;X;Y;Z),
eclass: EClass(A[eo; e]),
Id: Id,
uall: ∀[x:A]. B[x],
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,
rec-combined-class-opt-3: rec-combined-class-opt-3(F;init;X;Y;Z),
nat: ℕ,
le: A ≤ B,
and: P ∧ Q,
less_than': less_than'(a;b),
false: False,
not: ¬A,
implies: P ⇒ Q,
prop: ℙ,
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,
sq_type: SQType(T),
select: L[n],
cons: [a / b],
subtract: n - m,
less_than: a < b,
squash: ↓T,
true: True,
subtype_rel: A ⊆r B,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2]
Latex:
\mforall{}[Info,A,B,C,D:Type]. \mforall{}[F:bag(A) {}\mrightarrow{} bag(B) {}\mrightarrow{} bag(C) {}\mrightarrow{} bag(D) {}\mrightarrow{} bag(D)]. \mforall{}[init:Id {}\mrightarrow{} bag(D)].
\mforall{}[X:EClass(A)]. \mforall{}[Y:EClass(B)]. \mforall{}[Z:EClass(C)].
(rec-combined-class-opt-3(F;init;X;Y;Z) \mmember{} EClass(D))
Date html generated:
2016_05_17-AM-00_11_39
Last ObjectModification:
2016_01_17-PM-06_54_32
Theory : event-ordering
Home
Index