Nuprl Lemma : lnk-inv-one-one
∀[l1,l2:IdLnk]. uiff(lnk-inv(l1) = lnk-inv(l2) ∈ IdLnk;l1 = l2 ∈ IdLnk)
Proof
Definitions occuring in Statement :
lnk-inv: lnk-inv(l),
IdLnk: IdLnk,
uiff: uiff(P;Q),
uall: ∀[x:A]. B[x],
equal: s = t ∈ T
Definitions unfolded in proof :
uall: ∀[x:A]. B[x],
member: t ∈ T,
uiff: uiff(P;Q),
and: P ∧ Q,
uimplies: b supposing a,
prop: ℙ,
guard: {T},
iff: P ⇐⇒ Q,
implies: P ⇒ Q
Latex:
\mforall{}[l1,l2:IdLnk]. uiff(lnk-inv(l1) = lnk-inv(l2);l1 = l2)
Date html generated:
2016_05_16-AM-10_53_35
Last ObjectModification:
2015_12_29-AM-09_07_45
Theory : event-ordering
Home
Index