Nuprl Lemma : st-key-match_wf

[T:Id ⟶ Type]. ∀[tab:secret-table(T)]. ∀[k1,k2:ℕ Atom1].  (st-key-match(tab;k1;k2) ∈ 𝔹)


Proof




Definitions occuring in Statement :  st-key-match: st-key-match(tab;k1;k2) secret-table: secret-table(T) Id: Id nat: atom: Atom$n bool: 𝔹 uall: [x:A]. B[x] member: t ∈ T function: x:A ⟶ B[x] union: left right universe: Type
Definitions unfolded in proof :  uall: [x:A]. B[x] member: t ∈ T st-key-match: st-key-match(tab;k1;k2) nat: subtype_rel: A ⊆B all: x:A. B[x] implies:  Q bool: 𝔹 unit: Unit it: btrue: tt band: p ∧b q ifthenelse: if then else fi  uiff: uiff(P;Q) and: P ∧ Q uimplies: supposing a bfalse: ff exists: x:A. B[x] prop: or: P ∨ Q sq_type: SQType(T) guard: {T} int_seg: {i..j-} lelt: i ≤ j < k le: A ≤ B assert: b false: False

Latex:
\mforall{}[T:Id  {}\mrightarrow{}  Type].  \mforall{}[tab:secret-table(T)].  \mforall{}[k1,k2:\mBbbN{}  +  Atom1].    (st-key-match(tab;k1;k2)  \mmember{}  \mBbbB{})



Date html generated: 2016_05_16-AM-10_03_01
Last ObjectModification: 2015_12_28-PM-09_28_08

Theory : new!event-ordering


Home Index