Nuprl Lemma : consensus-ts3_wf
∀[V:Type]. (consensus-ts3(V) ∈ transition-system{i:l})
Proof
Definitions occuring in Statement :
consensus-ts3: consensus-ts3(T),
uall: ∀[x:A]. B[x],
member: t ∈ T,
universe: Type,
transition-system: transition-system{i:l}
Definitions unfolded in proof :
consensus-ts3: consensus-ts3(T),
transition-system: transition-system{i:l},
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
and: P ∧ Q,
so_lambda: λ2x.t[x],
implies: P ⇒ Q,
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],
false: False,
not: ¬A,
top: Top,
so_apply: x[s],
subtype_rel: A ⊆r B,
infix_ap: x f y
Latex:
\mforall{}[V:Type]. (consensus-ts3(V) \mmember{} transition-system\{i:l\})
Date html generated:
2016_05_16-AM-11_51_29
Last ObjectModification:
2016_01_17-PM-03_51_18
Theory : event-ordering
Home
Index