Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  dath Structured version   Visualization version   GIF version

Theorem dath 40761
Description: Desargues's theorem of projective geometry (proved for a Hilbert lattice). Assume each triple of atoms (points) 𝑃𝑄𝑅 and 𝑆𝑇𝑈 forms a triangle (i.e. determines a plane). Assume that lines 𝑃𝑆, 𝑄𝑇, and 𝑅𝑈 meet at a "center of perspectivity" 𝐶. (We also assume that 𝐶 is not on any of the 6 lines forming the two triangles.) Then the atoms 𝐷 = (𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇), 𝐸 = (𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈), 𝐹 = (𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆) are colinear, forming an "axis of perspectivity".

Our proof roughly follows Theorem 2.7.1, p. 78 in Beutelspacher and Rosenbaum, Projective Geometry: From Foundations to Applications, Cambridge University Press (1988). Unlike them, we do not assume that 𝐶 is an atom to make this theorem slightly more general for easier future use. However, we prove that 𝐶 must be an atom in dalemcea 40685.

For a visual demonstration, see the "Desargues's theorem" applet at http://www.dynamicgeometry.com/JavaSketchpad/Gallery.html 40685. The points I, J, and K there define the axis of perspectivity.

See Theorems dalaw 40911 for Desargues's law, which eliminates all of the preconditions on the atoms except for central perspectivity. This is Metamath 100 proof #87. (Contributed by NM, 20-Aug-2012.)

Hypotheses
Ref Expression
dath.b 𝐵 = (Base‘𝐾)
dath.l ≤ = (le‘𝐾)
dath.j ∨ = (join‘𝐾)
dath.a 𝐴 = (Atoms‘𝐾)
dath.m ∧ = (meet‘𝐾)
dath.o 𝑂 = (LPlanes‘𝐾)
dath.d 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
dath.e 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
dath.f 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
Assertion
Ref Expression
dath ((((𝐾 ∈ HL ∧ 𝐶 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ 𝑂 ∧ ((𝑆 ∨ 𝑇) ∨ 𝑈) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))) → 𝐹 ≤ (𝐷 ∨ 𝐸))

Proof of Theorem dath
StepHypRef Expression
1 dath.b . . . . . 6 𝐵 = (Base‘𝐾)
21eleq2i 2853 . . . . 5 (𝐶 ∈ 𝐵 ↔ 𝐶 ∈ (Base‘𝐾))
32anbi2i 635 . . . 4 ((𝐾 ∈ HL ∧ 𝐶 ∈ 𝐵) ↔ (𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)))
433anbi1i 1175 . . 3 (((𝐾 ∈ HL ∧ 𝐶 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ↔ ((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)))
543anbi1i 1175 . 2 ((((𝐾 ∈ HL ∧ 𝐶 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ 𝑂 ∧ ((𝑆 ∨ 𝑇) ∨ 𝑈) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))) ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ 𝑂 ∧ ((𝑆 ∨ 𝑇) ∨ 𝑈) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
6 dath.l . 2 ≤ = (le‘𝐾)
7 dath.j . 2 ∨ = (join‘𝐾)
8 dath.a . 2 𝐴 = (Atoms‘𝐾)
9 dath.m . 2 ∧ = (meet‘𝐾)
10 dath.o . 2 𝑂 = (LPlanes‘𝐾)
11 eqid 2761 . 2 ((𝑃 ∨ 𝑄) ∨ 𝑅) = ((𝑃 ∨ 𝑄) ∨ 𝑅)
12 eqid 2761 . 2 ((𝑆 ∨ 𝑇) ∨ 𝑈) = ((𝑆 ∨ 𝑇) ∨ 𝑈)
13 dath.d . 2 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
14 dath.e . 2 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
15 dath.f . 2 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
165, 6, 7, 8, 9, 10, 11, 12, 13, 14, 15dalem63 40760 1 ((((𝐾 ∈ HL ∧ 𝐶 ∈ 𝐵) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (((𝑃 ∨ 𝑄) ∨ 𝑅) ∈ 𝑂 ∧ ((𝑆 ∨ 𝑇) ∨ 𝑈) ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))) → 𝐹 ≤ (𝐷 ∨ 𝐸))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   class class class wbr 5103  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  lecple 17415  joincjn 18465  meetcmee 18466  Atomscatm 40288  HLchlt 40375  LPlanesclpl 40517
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-rep 5232  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7740
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rmo 3366  df-reu 3367  df-rab 3414  df-v 3453  df-sbc 3740  df-csb 3848  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-iun 4953  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6487  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7369  df-ov 7415  df-oprab 7416  df-proset 18448  df-poset 18467  df-plt 18482  df-lub 18498  df-glb 18499  df-join 18500  df-meet 18501  df-p0 18577  df-p1 18578  df-lat 18586  df-clat 18653  df-oposet 40201  df-ol 40203  df-oml 40204  df-covers 40291  df-ats 40292  df-atl 40323  df-cvlat 40347  df-hlat 40376  df-llines 40523  df-lplanes 40524  df-lvols 40525
This theorem is used by:  dath2  40762
  Copyright terms: Public domain W3C validator