Nuprl Lemma : update-oarcast-deliver_wf
∀[M:Type]. ∀[eq:M ⟶ M ⟶ 𝔹]. ∀[s:bag(Id) × ((M × ℕ) List)]. ∀[p:Id × M].
(update-oarcast-deliver(eq;s;p) ∈ bag(Id) × ((M × ℕ) List))
Proof
Definitions occuring in Statement :
update-oarcast-deliver: update-oarcast-deliver(eq;s;p),
Id: Id,
list: T List,
nat: ℕ,
bool: 𝔹,
uall: ∀[x:A]. B[x],
member: t ∈ T,
function: x:A ⟶ B[x],
product: x:A × B[x],
universe: Type,
bag: bag(T)
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
update-oarcast-deliver: update-oarcast-deliver(eq;s;p),
all: ∀x:A. B[x],
implies: P ⇒ Q,
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
ifthenelse: if b then t else f fi ,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
has-value: (a)↓,
subtype_rel: A ⊆r B,
so_lambda: λ2x.t[x],
so_apply: x[s],
nat: ℕ,
le: A ≤ B,
less_than': less_than'(a;b),
false: False,
not: ¬A,
prop: ℙ,
ge: i ≥ j ,
decidable: Dec(P),
or: P ∨ Q,
satisfiable_int_formula: satisfiable_int_formula(fmla),
exists: ∃x:A. B[x],
top: Top,
bfalse: ff,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
assert: ↑b
Latex:
\mforall{}[M:Type]. \mforall{}[eq:M {}\mrightarrow{} M {}\mrightarrow{} \mBbbB{}]. \mforall{}[s:bag(Id) \mtimes{} ((M \mtimes{} \mBbbN{}) List)]. \mforall{}[p:Id \mtimes{} M].
(update-oarcast-deliver(eq;s;p) \mmember{} bag(Id) \mtimes{} ((M \mtimes{} \mBbbN{}) List))
Date html generated:
2016_05_17-PM-00_57_40
Last ObjectModification:
2016_01_18-AM-07_38_10
Theory : event-logic-applications
Home
Index