Nuprl Lemma : ses-nonce-unique
∀[s:SES]. PropertyNU supposing PropertyN
Proof
Definitions occuring in Statement :
ses-NU: PropertyNU,
ses-nonce: PropertyN,
security-event-structure: SES,
uimplies: b supposing a,
uall: ∀[x:A]. B[x]
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uimplies: b supposing a,
ses-nonce: PropertyN,
ses-NU: PropertyNU,
all: ∀x:A. B[x],
implies: P ⇒ Q,
prop: ℙ,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
es-E-interface: E(X),
top: Top,
sq_type: SQType(T),
guard: {T},
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
event-has*: e has* a,
exists: ∃x:A. B[x],
and: P ∧ Q,
cand: A c∧ B,
sq_stable: SqStable(P),
squash: ↓T,
event-has: (e has a),
or: P ∨ Q,
class-value-has: X(e) has a,
not: ¬A,
so_lambda: λ2x.t[x],
so_apply: x[s],
es-causle: e c≤ e',
false: False
Latex:
\mforall{}[s:SES]. PropertyNU supposing PropertyN
Date html generated:
2016_05_17-PM-00_23_34
Last ObjectModification:
2016_01_18-AM-07_44_50
Theory : event-logic-applications
Home
Index