Nuprl Lemma : ses-D-implies
∀s:SES. (PropertyD ⇒ {ses-D-public(s) ∧ ses-D-private(s)} supposing PropertyK)
Proof
Definitions occuring in Statement :
ses-D-private: ses-D-private(s),
ses-D-public: ses-D-public(s),
ses-K: PropertyK,
ses-D: PropertyD,
security-event-structure: SES,
uimplies: b supposing a,
guard: {T},
all: ∀x:A. B[x],
implies: P ⇒ Q,
and: P ∧ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
uimplies: b supposing a,
member: t ∈ T,
ses-K: PropertyK,
and: P ∧ Q,
sym: Sym(T;x,y.E[x; y]),
uall: ∀[x:A]. B[x],
prop: ℙ,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
ses-D: PropertyD,
guard: {T},
ses-D-public: ses-D-public(s),
ses-decryption-key: key(e),
ses-cipher: cipherText(e),
ses-decrypted: plainText(e),
ses-encryption-key: key(e),
ses-crypt: cipherText(e),
ses-encrypted: plainText(e),
so_lambda: λ2x.t[x],
so_apply: x[s],
encryption-key: Key,
Id: Id,
sq_type: SQType(T),
pi1: fst(t),
pi2: snd(t),
exists: ∃x:A. B[x],
cand: A c∧ B,
so_lambda: λ2x y.t[x; y],
subtype_rel: A ⊆r B,
so_apply: x[s1;s2],
es-E-interface: E(X),
top: Top,
assert: ↑b,
ifthenelse: if b then t else f fi ,
btrue: tt,
true: True,
ses-D-private: ses-D-private(s)
Latex:
\mforall{}s:SES. (PropertyD {}\mRightarrow{} \{ses-D-public(s) \mwedge{} ses-D-private(s)\} supposing PropertyK)
Date html generated:
2016_05_17-PM-00_27_02
Last ObjectModification:
2015_12_29-PM-06_37_37
Theory : event-logic-applications
Home
Index