Nuprl Lemma : deq-runEvents-witness_wf
∀[M:Type ⟶ Type]. ∀[r:pRunType(P.M[P])]. (deq-runEvents-witness() ∈ ∀e1,e2:runEvents(r). Dec(e1 = e2 ∈ runEvents(r)))
Proof
Definitions occuring in Statement :
deq-runEvents-witness: deq-runEvents-witness(),
runEvents: runEvents(r),
pRunType: pRunType(T.M[T]),
decidable: Dec(P),
uall: ∀[x:A]. B[x],
so_apply: x[s],
all: ∀x:A. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
subtype_rel: A ⊆r B,
all: ∀x:A. B[x],
so_apply: x[s],
so_lambda: λ2x.t[x],
prop: ℙ,
deq-runEvents-witness: deq-runEvents-witness(),
decidable__equal_runEvents,
decidable__equal_set,
decidable__equal_product,
so_lambda: so_lambda(x,y,z,w.t[x; y; z; w]),
so_apply: x[s1;s2;s3;s4],
top: Top,
uimplies: b supposing a,
strict4: strict4(F),
and: P ∧ Q,
implies: P ⇒ Q,
has-value: (a)↓,
guard: {T},
or: P ∨ Q,
squash: ↓T,
so_lambda: λ2x y.t[x; y],
so_apply: x[s1;s2],
decidable__equal_nat,
decidable__int_equal,
decidable__equal_Id,
experimental: experimental{allFunctionality}(possibleextract),
decidable_functionality,
iff_preserves_decidability,
decidable__assert,
eq_id: a = b,
id-deq: IdDeq,
atom2-deq: Atom2Deq,
eq_atom: eq_atom$n(x;y),
btrue: tt,
bfalse: ff,
it: ⋅
Latex:
\mforall{}[M:Type {}\mrightarrow{} Type]. \mforall{}[r:pRunType(P.M[P])].
(deq-runEvents-witness() \mmember{} \mforall{}e1,e2:runEvents(r). Dec(e1 = e2))
Date html generated:
2016_05_17-AM-10_42_56
Last ObjectModification:
2016_01_18-AM-00_14_28
Theory : process-model
Home
Index