### Nuprl Lemma : eu-add-length-zero3

`∀[e:EuclideanPlane]. ∀[x:{p:Point| O_X_p} ]. ∀[a:Point].  (|aa| + x = x ∈ {p:Point| O_X_p} )`

Proof

Definitions occuring in Statement :  eu-add-length: `p + q` eu-length: `|s|` eu-mk-seg: `ab` euclidean-plane: `EuclideanPlane` eu-between-eq: `a_b_c` eu-X: `X` eu-O: `O` eu-point: `Point` uall: `∀[x:A]. B[x]` set: `{x:A| B[x]} ` equal: `s = t ∈ T`
Definitions unfolded in proof :  uall: `∀[x:A]. B[x]` member: `t ∈ T` euclidean-plane: `EuclideanPlane` all: `∀x:A. B[x]` prop: `ℙ` uimplies: `b supposing a` guard: `{T}` iff: `P `⇐⇒` Q` and: `P ∧ Q` rev_implies: `P `` Q` implies: `P `` Q`
Lemmas referenced :  eu-add-length-zero2 eu-point_wf eu-between-eq_wf eu-O_wf eu-X_wf eu-add-length-comm eu-length_wf eu-mk-seg_wf iff_weakening_equal euclidean-plane_wf
Rules used in proof :  cut lemma_by_obid sqequalSubstitution sqequalTransitivity computationStep sqequalReflexivity isect_memberFormation hypothesis sqequalHypSubstitution isectElimination thin hypothesisEquality equalityEquality setEquality setElimination rename dependent_functionElimination because_Cache equalityTransitivity equalitySymmetry independent_isectElimination productElimination independent_functionElimination

Latex:
\mforall{}[e:EuclideanPlane].  \mforall{}[x:\{p:Point|  O\_X\_p\}  ].  \mforall{}[a:Point].    (|aa|  +  x  =  x)

Date html generated: 2016_05_18-AM-06_38_19
Last ObjectModification: 2015_12_28-AM-09_24_31

Theory : euclidean!geometry

Home Index