Nuprl Lemma : Euclid-drop-perp-0-ext

e:EuclideanPlane. ∀a:Point. ∀b:{b:Point| b} . ∀c:Point.
  ∃x:Point. (∃p:Point [(Colinear(p;x;c) ∧ ab  ⊥px ∧ ab ∧ c)])


Proof




Definitions occuring in Statement :  geo-perp-in: ab  ⊥cd euclidean-plane: EuclideanPlane geo-colinear: Colinear(a;b;c) geo-lsep: bc geo-sep: b geo-point: Point all: x:A. B[x] sq_exists: x:A [B[x]] exists: x:A. B[x] and: P ∧ Q set: {x:A| B[x]} 
Definitions unfolded in proof :  member: t ∈ T record-select: r.x geo-CCL: CCL(a;b;c;d) geo-CCR: geo-CCR(g;a;b;c;d) ifthenelse: if then else fi  let: let Euclid-drop-perp-0 colinear-equidistant-points-exist geo-CC-2 geo-congruent-refl geo-sep-sym geo-sep-or symmetric-point-construction use-SC sq_stable__geo-sep geo-between-implies-colinear geo-congruent-sep geo-congruent-symmetry geo-congruent-iff-length sq_stable__and sq_stable__geo-congruent sq_stable__geo-between sq_stable__all basic-geo-sep-sym sq_stable__geo-axioms geo-ge-sep geo-seg-congruent-iff-length geo-cong-preserves-gt-prim sq_stable-geo-axioms-if sq_stable__geo-gt-prim sq_stable__geo-lsep any: any x uall: [x:A]. B[x] so_lambda: so_lambda4 so_apply: x[s1;s2;s3;s4] so_lambda: λ2y.t[x; y] so_apply: x[s1;s2] uimplies: supposing a so_lambda: λ2x.t[x] so_apply: x[s]

Latex:
\mforall{}e:EuclideanPlane.  \mforall{}a:Point.  \mforall{}b:\{b:Point|  a  \#  b\}  .  \mforall{}c:Point.
    \mexists{}x:Point.  (\mexists{}p:Point  [(Colinear(p;x;c)  \mwedge{}  ab    \mbot{}p  px  \mwedge{}  x  \#  ab  \mwedge{}  x  \#  c)])



Date html generated: 2020_05_20-AM-10_04_22
Last ObjectModification: 2020_01_27-PM-07_13_26

Theory : euclidean!plane!geometry


Home Index