Nuprl Lemma : lnk-inv-inv
∀[l:IdLnk]. (lnk-inv(lnk-inv(l)) = l ∈ IdLnk)
Proof
Definitions occuring in Statement :
lnk-inv: lnk-inv(l),
IdLnk: IdLnk,
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
lnk-inv: lnk-inv(l),
IdLnk: IdLnk,
pi2: snd(t),
pi1: fst(t),
uall: ∀[x:A]. B[x],
member: t ∈ T
Latex:
\mforall{}[l:IdLnk]. (lnk-inv(lnk-inv(l)) = l)
Date html generated:
2016_05_16-AM-10_53_33
Last ObjectModification:
2015_12_29-AM-09_07_24
Theory : event-ordering
Home
Index