Nuprl Lemma : not-dist-to-le
∀g:EuclideanPlane. ∀a,b,c,d,e,f:Point. ((¬D(a;b;c;d;e;f)) ⇒ |ab| + |cd| ≤ |ef|)
Proof
Definitions occuring in Statement :
dist: D(a;b;c;d;e;f),
geo-le: p ≤ q,
geo-add-length: p + q,
geo-length: |s|,
geo-mk-seg: ab,
euclidean-plane: EuclideanPlane,
geo-point: Point,
all: ∀x:A. B[x],
not: ¬A,
implies: P ⇒ Q
Definitions unfolded in proof :
all: ∀x:A. B[x],
implies: P ⇒ Q,
member: t ∈ T,
uall: ∀[x:A]. B[x],
euclidean-plane: EuclideanPlane,
prop: ℙ,
subtype_rel: A ⊆r B,
guard: {T},
uimplies: b supposing a
Lemmas referenced :
not-dist-lemma-lt,
geo-not-lt-to-le,
not_wf,
dist_wf,
geo-point_wf,
euclidean-plane-structure-subtype,
euclidean-plane-subtype,
subtype_rel_transitivity,
euclidean-plane_wf,
euclidean-plane-structure_wf,
geo-primitives_wf
Rules used in proof :
sqequalSubstitution,
sqequalTransitivity,
computationStep,
sqequalReflexivity,
lambdaFormation_alt,
cut,
introduction,
extract_by_obid,
sqequalHypSubstitution,
dependent_functionElimination,
thin,
hypothesisEquality,
independent_functionElimination,
hypothesis,
because_Cache,
universeIsType,
isectElimination,
setElimination,
rename,
inhabitedIsType,
applyEquality,
instantiate,
independent_isectElimination,
sqequalRule
Latex:
\mforall{}g:EuclideanPlane. \mforall{}a,b,c,d,e,f:Point. ((\mneg{}D(a;b;c;d;e;f)) {}\mRightarrow{} |ab| + |cd| \mleq{} |ef|)
Date html generated:
2019_10_16-PM-02_53_04
Last ObjectModification:
2018_10_04-AM-11_01_45
Theory : euclidean!plane!geometry
Home
Index