Nuprl Lemma : pgeo-leq_weakening
∀g:ProjectivePlane. ∀l,m:Line. ((l = m ∈ Line) ⇒ l ≡ m)
Proof
Definitions occuring in Statement :
projective-plane: ProjectivePlane,
pgeo-leq: a ≡ b,
pgeo-line: Line,
all: ∀x:A. B[x],
implies: P ⇒ Q,
equal: s = t ∈ T
Definitions unfolded in proof :
uimplies: b supposing a,
guard: {T},
subtype_rel: A ⊆r B,
uall: ∀[x:A]. B[x],
prop: ℙ,
member: t ∈ T,
implies: P ⇒ Q,
all: ∀x:A. B[x],
not: ¬A,
pgeo-leq: a ≡ b,
and: P ∧ Q,
exists: ∃x:A. B[x],
pgeo-lsep: l ≠ m,
false: False,
pgeo-incident: a I b
Lemmas referenced :
pgeo-primitives_wf,
projective-plane-structure_wf,
basic-projective-plane_wf,
projective-plane_wf,
subtype_rel_transitivity,
projective-plane-subtype,
basic-projective-plane-subtype,
projective-plane-structure_subtype,
pgeo-line_wf,
equal_wf,
pgeo-leq_wf,
pgeo-lsep_wf
Rules used in proof :
independent_isectElimination,
instantiate,
sqequalRule,
because_Cache,
applyEquality,
hypothesisEquality,
isectElimination,
sqequalHypSubstitution,
extract_by_obid,
introduction,
applyLambdaEquality,
equalitySymmetry,
hyp_replacement,
thin,
hypothesis,
cut,
lambdaFormation,
sqequalReflexivity,
computationStep,
sqequalTransitivity,
sqequalSubstitution,
productElimination,
voidElimination,
independent_functionElimination
Latex:
\mforall{}g:ProjectivePlane. \mforall{}l,m:Line. ((l = m) {}\mRightarrow{} l \mequiv{} m)
Date html generated:
2018_05_22-PM-00_44_49
Last ObjectModification:
2017_11_27-PM-04_08_35
Theory : euclidean!plane!geometry
Home
Index