Nuprl Lemma : ss-sep-irrefl
∀[ss:SeparationSpace]. ∀[x:Point]. (¬x # x)
Proof
Definitions occuring in Statement :
ss-sep: x # y,
ss-point: Point,
separation-space: SeparationSpace,
uall: ∀[x:A]. B[x],
not: ¬A
Definitions unfolded in proof :
ss-point: Point,
squash: ↓T,
ss-sep: x # y,
or: P ∨ Q,
all: ∀x:A. B[x],
so_apply: x[s],
so_lambda: λ2x.t[x],
prop: ℙ,
guard: {T},
btrue: tt,
ifthenelse: if b then t else f fi ,
eq_atom: x =a y,
subtype_rel: A ⊆r B,
record-select: r.x,
record+: record+,
separation-space: SeparationSpace,
false: False,
implies: P ⇒ Q,
not: ¬A,
member: t ∈ T,
uall: ∀[x:A]. B[x]
Lemmas referenced :
separation-space_wf,
ss-point_wf,
ss-sep_wf,
or_wf,
not_wf,
all_wf,
subtype_rel_self
Rules used in proof :
imageElimination,
baseClosed,
imageMemberEquality,
Error :applyLambdaEquality,
isect_memberEquality,
dependent_functionElimination,
voidElimination,
independent_functionElimination,
rename,
setElimination,
functionExtensionality,
because_Cache,
hypothesisEquality,
cumulativity,
lambdaEquality,
equalitySymmetry,
equalityTransitivity,
functionEquality,
setEquality,
universeEquality,
isectElimination,
extract_by_obid,
instantiate,
tokenEquality,
applyEquality,
hypothesis,
dependentIntersectionEqElimination,
sqequalRule,
dependentIntersectionElimination,
sqequalHypSubstitution,
thin,
lambdaFormation,
cut,
introduction,
isect_memberFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution
Latex:
\mforall{}[ss:SeparationSpace]. \mforall{}[x:Point]. (\mneg{}x \# x)
Date html generated:
2016_11_08-AM-09_10_48
Last ObjectModification:
2016_11_02-PM-03_15_57
Theory : inner!product!spaces
Home
Index