Nuprl Lemma : three-consensus-ts_wf
∀[V:Type]. ∀[A:Id List]. ∀[t:ℕ]. ∀[f:(V List) ⟶ V]. (three-consensus-ts(V;A;t;f) ∈ transition-system{i:l})
Proof
Definitions occuring in Statement :
three-consensus-ts: three-consensus-ts(V;A;t;f),
Id: Id,
list: T List,
nat: ℕ,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
universe: Type,
transition-system: transition-system{i:l}
Definitions unfolded in proof :
three-consensus-ts: three-consensus-ts(V;A;t;f),
transition-system: transition-system{i:l},
uall: ∀[x:A]. B[x],
member: t ∈ T,
prop: ℙ,
all: ∀x:A. B[x],
so_lambda: λ2x.t[x],
and: P ∧ Q,
implies: P ⇒ Q,
nat: ℕ,
so_apply: x[s],
exists: ∃x:A. B[x],
subtype_rel: A ⊆r B,
uimplies: b supposing a,
top: Top,
infix_ap: x f y
Latex:
\mforall{}[V:Type]. \mforall{}[A:Id List]. \mforall{}[t:\mBbbN{}]. \mforall{}[f:(V List) {}\mrightarrow{} V].
(three-consensus-ts(V;A;t;f) \mmember{} transition-system\{i:l\})
Date html generated:
2016_05_16-PM-00_44_16
Last ObjectModification:
2015_12_29-PM-01_36_51
Theory : event-ordering
Home
Index