Nuprl Lemma : sdata-pair-free-from-atom
∀[b:Atom1]. ∀[d1,d2:SecurityData].  uiff(b#<d1, d2>:SecurityData;b#d1:SecurityData ∧ b#d2:SecurityData)
Proof
Definitions occuring in Statement : 
sdata-pair: <d1, d2>
, 
sdata: SecurityData
, 
free-from-atom: a#x:T
, 
atom: Atom$n
, 
uiff: uiff(P;Q)
, 
uall: ∀[x:A]. B[x]
, 
and: P ∧ Q
Definitions unfolded in proof : 
uall: ∀[x:A]. B[x]
, 
member: t ∈ T
, 
uiff: uiff(P;Q)
, 
and: P ∧ Q
, 
uimplies: b supposing a
, 
prop: ℙ
, 
not: ¬A
, 
implies: P 
⇒ Q
, 
all: ∀x:A. B[x]
, 
top: Top
, 
iff: P 
⇐⇒ Q
, 
rev_implies: P 
⇐ Q
, 
or: P ∨ Q
, 
guard: {T}
, 
false: False
Latex:
\mforall{}[b:Atom1].  \mforall{}[d1,d2:SecurityData].
    uiff(b\#<d1,  d2>:SecurityData;b\#d1:SecurityData  \mwedge{}  b\#d2:SecurityData)
Date html generated:
2016_05_17-AM-11_40_07
Last ObjectModification:
2015_12_29-PM-06_47_14
Theory : event-logic-applications
Home
Index