Nuprl Lemma : assert-isrcvl
∀[k:Knd]. ∀[l:IdLnk]. uiff(↑isrcvl(l;k);(↑isrcv(k)) ∧ (lnk(k) = l ∈ IdLnk))
Proof
Definitions occuring in Statement :
isrcvl: isrcvl(l;k),
lnk: lnk(k),
isrcv: isrcv(k),
Knd: Knd,
IdLnk: IdLnk,
assert: ↑b,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
and: P ∧ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
isrcvl: isrcvl(l;k),
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
member: t ∈ T,
implies: P ⇒ Q,
prop: ℙ,
all: ∀x:A. B[x],
bool: 𝔹,
unit: Unit,
it: ⋅,
btrue: tt,
band: p ∧b q,
ifthenelse: if b then t else f fi ,
bfalse: ff,
iff: P ⇐⇒ Q,
rev_implies: P ⇐ Q,
cand: A c∧ B,
assert: ↑b,
true: True,
exists: ∃x:A. B[x],
or: P ∨ Q,
sq_type: SQType(T),
guard: {T},
bnot: ¬bb,
false: False
Latex:
\mforall{}[k:Knd]. \mforall{}[l:IdLnk]. uiff(\muparrow{}isrcvl(l;k);(\muparrow{}isrcv(k)) \mwedge{} (lnk(k) = l))
Date html generated:
2016_05_16-AM-10_57_56
Last ObjectModification:
2015_12_29-AM-09_09_35
Theory : event-ordering
Home
Index