Theorem dalem16 40736

Description: Lemma for dath 40793. The atoms 𝐷, 𝐸, and 𝐹 form a line of perspectivity. This is Desargues's theorem for the special case where planes 𝑌 and 𝑍 are different. (Contributed by NM, 7-Aug-2012.)

Hypotheses

Ref	Expression
dalema.ph	⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
dalemc.l	⊢ ≤ = (le‘𝐾)
dalemc.j	⊢ ∨ = (join‘𝐾)
dalemc.a	⊢ 𝐴 = (Atoms‘𝐾)
dalem16.m	⊢ ∧ = (meet‘𝐾)
dalem16.o	⊢ 𝑂 = (LPlanes‘𝐾)
dalem16.y	⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
dalem16.z	⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
dalem16.d	⊢ 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
dalem16.e	⊢ 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
dalem16.f	⊢ 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))

Assertion

Ref	Expression
dalem16	⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐹 ≤ (𝐷 ∨ 𝐸))

Proof of Theorem dalem16

Step	Hyp	Ref	Expression
1		dalema.ph	. . . 4 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
2		dalemc.l	. . . 4 ⊢ ≤ = (le‘𝐾)
3		dalemc.j	. . . 4 ⊢ ∨ = (join‘𝐾)
4		dalemc.a	. . . 4 ⊢ 𝐴 = (Atoms‘𝐾)
5		dalem16.m	. . . 4 ⊢ ∧ = (meet‘𝐾)
6		dalem16.o	. . . 4 ⊢ 𝑂 = (LPlanes‘𝐾)
7		dalem16.y	. . . 4 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
8		dalem16.z	. . . 4 ⊢ 𝑍 = ((𝑆 ∨ 𝑇) ∨ 𝑈)
9		eqid 2761	. . . 4 ⊢ (𝑌 ∧ 𝑍) = (𝑌 ∧ 𝑍)
10		dalem16.f	. . . 4 ⊢ 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	dalem12 40732	. . 3 ⊢ (𝜑 → 𝐹 ≤ (𝑌 ∧ 𝑍))
12	11	adantr 486	. 2 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐹 ≤ (𝑌 ∧ 𝑍))
13		dalem16.d	. . . . . 6 ⊢ 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
14	1, 2, 3, 4, 5, 6, 7, 8, 9, 13	dalem10 40730	. . . . 5 ⊢ (𝜑 → 𝐷 ≤ (𝑌 ∧ 𝑍))
15		dalem16.e	. . . . . 6 ⊢ 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 15	dalem11 40731	. . . . 5 ⊢ (𝜑 → 𝐸 ≤ (𝑌 ∧ 𝑍))
17	1	dalemkelat 40681	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Lat)
18	1, 2, 3, 4, 5, 6, 7, 8, 13	dalemdea 40719	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝐴)
19		eqid 2761	. . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾)
20	19, 4	atbase 40346	. . . . . . 7 ⊢ (𝐷 ∈ 𝐴 → 𝐷 ∈ (Base‘𝐾))
21	18, 20	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (Base‘𝐾))
22	1, 2, 3, 4, 5, 6, 7, 8, 15	dalemeea 40720	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ 𝐴)
23	19, 4	atbase 40346	. . . . . . 7 ⊢ (𝐸 ∈ 𝐴 → 𝐸 ∈ (Base‘𝐾))
24	22, 23	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (Base‘𝐾))
25	1, 6	dalemyeb 40706	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐾))
26	1	dalemzeo 40690	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑂)
27	19, 6	lplnbase 40591	. . . . . . . 8 ⊢ (𝑍 ∈ 𝑂 → 𝑍 ∈ (Base‘𝐾))
28	26, 27	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ (Base‘𝐾))
29	19, 5	latmcl 18614	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ (Base‘𝐾) ∧ 𝑍 ∈ (Base‘𝐾)) → (𝑌 ∧ 𝑍) ∈ (Base‘𝐾))
30	17, 25, 28, 29	syl3anc 1398	. . . . . 6 ⊢ (𝜑 → (𝑌 ∧ 𝑍) ∈ (Base‘𝐾))
31	19, 2, 3	latjle12 18624	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝐷 ∈ (Base‘𝐾) ∧ 𝐸 ∈ (Base‘𝐾) ∧ (𝑌 ∧ 𝑍) ∈ (Base‘𝐾))) → ((𝐷 ≤ (𝑌 ∧ 𝑍) ∧ 𝐸 ≤ (𝑌 ∧ 𝑍)) ↔ (𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍)))
32	17, 21, 24, 30, 31	syl13anc 1399	. . . . 5 ⊢ (𝜑 → ((𝐷 ≤ (𝑌 ∧ 𝑍) ∧ 𝐸 ≤ (𝑌 ∧ 𝑍)) ↔ (𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍)))
33	14, 16, 32	mpbi2and 725	. . . 4 ⊢ (𝜑 → (𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍))
34	33	adantr 486	. . 3 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍))
35	1	dalemkehl 40680	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL)
36	35	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐾 ∈ HL)
37	1, 2, 3, 4, 5, 6, 7, 8, 13, 15	dalemdnee 40723	. . . . . 6 ⊢ (𝜑 → 𝐷 ≠ 𝐸)
38		eqid 2761	. . . . . . 7 ⊢ (LLines‘𝐾) = (LLines‘𝐾)
39	3, 4, 38	llni2 40569	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝐷 ∈ 𝐴 ∧ 𝐸 ∈ 𝐴) ∧ 𝐷 ≠ 𝐸) → (𝐷 ∨ 𝐸) ∈ (LLines‘𝐾))
40	35, 18, 22, 37, 39	syl31anc 1400	. . . . 5 ⊢ (𝜑 → (𝐷 ∨ 𝐸) ∈ (LLines‘𝐾))
41	40	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝐷 ∨ 𝐸) ∈ (LLines‘𝐾))
42	1, 2, 3, 4, 5, 38, 6, 7, 8, 9	dalem15 40735	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝑌 ∧ 𝑍) ∈ (LLines‘𝐾))
43	2, 38	llncmp 40579	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐷 ∨ 𝐸) ∈ (LLines‘𝐾) ∧ (𝑌 ∧ 𝑍) ∈ (LLines‘𝐾)) → ((𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍) ↔ (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍)))
44	36, 41, 42, 43	syl3anc 1398	. . 3 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → ((𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍) ↔ (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍)))
45	34, 44	mpbid 235	. 2 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍))
46	12, 45	breqtrrd 5133	1 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐹 ≤ (𝐷 ∨ 𝐸))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2956   class class class wbr 5103  ‘cfv 6538  (class class class)co 7420  Basecbs 17387  lecple 17435  joincjn 18485  meetcmee 18486  Latclat 18605  Atomscatm 40320  HLchlt 40407  LLinesclln 40548  LPlanesclpl 40549

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 7751

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 6494  df-fun 6540  df-fn 6541  df-f 6542  df-f1 6543  df-fo 6544  df-f1o 6545  df-fv 6546  df-riota 7377  df-ov 7423  df-oprab 7424  df-proset 18468  df-poset 18487  df-plt 18502  df-lub 18518  df-glb 18519  df-join 18520  df-meet 18521  df-p0 18597  df-lat 18606  df-clat 18673  df-oposet 40233  df-ol 40235  df-oml 40236  df-covers 40323  df-ats 40324  df-atl 40355  df-cvlat 40379  df-hlat 40408  df-llines 40555  df-lplanes 40556  df-lvols 40557

This theorem is used by:  dalem63  40792