Theorem dalem16 40560

Description: Lemma for dath 40617. 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 2762	. . . 4 ⊢ (𝑌 ∧ 𝑍) = (𝑌 ∧ 𝑍)
10		dalem16.f	. . . 4 ⊢ 𝐹 = ((𝑅 ∨ 𝑃) ∧ (𝑈 ∨ 𝑆))
11	1, 2, 3, 4, 5, 6, 7, 8, 9, 10	dalem12 40556	. . 3 ⊢ (𝜑 → 𝐹 ≤ (𝑌 ∧ 𝑍))
12	11	adantr 486	. 2 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐹 ≤ (𝑌 ∧ 𝑍))
13		dalem16.d	. . . . . 6 ⊢ 𝐷 = ((𝑃 ∨ 𝑄) ∧ (𝑆 ∨ 𝑇))
14	1, 2, 3, 4, 5, 6, 7, 8, 9, 13	dalem10 40554	. . . . 5 ⊢ (𝜑 → 𝐷 ≤ (𝑌 ∧ 𝑍))
15		dalem16.e	. . . . . 6 ⊢ 𝐸 = ((𝑄 ∨ 𝑅) ∧ (𝑇 ∨ 𝑈))
16	1, 2, 3, 4, 5, 6, 7, 8, 9, 15	dalem11 40555	. . . . 5 ⊢ (𝜑 → 𝐸 ≤ (𝑌 ∧ 𝑍))
17	1	dalemkelat 40505	. . . . . 6 ⊢ (𝜑 → 𝐾 ∈ Lat)
18	1, 2, 3, 4, 5, 6, 7, 8, 13	dalemdea 40543	. . . . . . 7 ⊢ (𝜑 → 𝐷 ∈ 𝐴)
19		eqid 2762	. . . . . . . 8 ⊢ (Base‘𝐾) = (Base‘𝐾)
20	19, 4	atbase 40170	. . . . . . 7 ⊢ (𝐷 ∈ 𝐴 → 𝐷 ∈ (Base‘𝐾))
21	18, 20	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐷 ∈ (Base‘𝐾))
22	1, 2, 3, 4, 5, 6, 7, 8, 15	dalemeea 40544	. . . . . . 7 ⊢ (𝜑 → 𝐸 ∈ 𝐴)
23	19, 4	atbase 40170	. . . . . . 7 ⊢ (𝐸 ∈ 𝐴 → 𝐸 ∈ (Base‘𝐾))
24	22, 23	syl 18	. . . . . 6 ⊢ (𝜑 → 𝐸 ∈ (Base‘𝐾))
25	1, 6	dalemyeb 40530	. . . . . . 7 ⊢ (𝜑 → 𝑌 ∈ (Base‘𝐾))
26	1	dalemzeo 40514	. . . . . . . 8 ⊢ (𝜑 → 𝑍 ∈ 𝑂)
27	19, 6	lplnbase 40415	. . . . . . . 8 ⊢ (𝑍 ∈ 𝑂 → 𝑍 ∈ (Base‘𝐾))
28	26, 27	syl 18	. . . . . . 7 ⊢ (𝜑 → 𝑍 ∈ (Base‘𝐾))
29	19, 5	latmcl 18534	. . . . . . 7 ⊢ ((𝐾 ∈ Lat ∧ 𝑌 ∈ (Base‘𝐾) ∧ 𝑍 ∈ (Base‘𝐾)) → (𝑌 ∧ 𝑍) ∈ (Base‘𝐾))
30	17, 25, 28, 29	syl3anc 1398	. . . . . 6 ⊢ (𝜑 → (𝑌 ∧ 𝑍) ∈ (Base‘𝐾))
31	19, 2, 3	latjle12 18544	. . . . . 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 40504	. . . . 5 ⊢ (𝜑 → 𝐾 ∈ HL)
36	35	adantr 486	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐾 ∈ HL)
37	1, 2, 3, 4, 5, 6, 7, 8, 13, 15	dalemdnee 40547	. . . . . 6 ⊢ (𝜑 → 𝐷 ≠ 𝐸)
38		eqid 2762	. . . . . . 7 ⊢ (LLines‘𝐾) = (LLines‘𝐾)
39	3, 4, 38	llni2 40393	. . . . . 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 40559	. . . 4 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝑌 ∧ 𝑍) ∈ (LLines‘𝐾))
43	2, 38	llncmp 40403	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝐷 ∨ 𝐸) ∈ (LLines‘𝐾) ∧ (𝑌 ∧ 𝑍) ∈ (LLines‘𝐾)) → ((𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍) ↔ (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍)))
44	36, 41, 42, 43	syl3anc 1398	. . 3 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → ((𝐷 ∨ 𝐸) ≤ (𝑌 ∧ 𝑍) ↔ (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍)))
45	34, 44	mpbid 235	. 2 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → (𝐷 ∨ 𝐸) = (𝑌 ∧ 𝑍))
46	12, 45	breqtrrd 5137	1 ⊢ ((𝜑 ∧ 𝑌 ≠ 𝑍) → 𝐹 ≤ (𝐷 ∨ 𝐸))

This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145   ≠ wne 2957   class class class wbr 5107  ‘cfv 6537  (class class class)co 7417  Basecbs 17307  lecple 17355  joincjn 18405  meetcmee 18406  Latclat 18525  Atomscatm 40144  HLchlt 40231  LLinesclln 40372  LPlanesclpl 40373

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 2215  ax-ext 2734  ax-rep 5236  ax-sep 5255  ax-nul 5267  ax-pow 5334  ax-pr 5402  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 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3079  df-rex 3089  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3455  df-sbc 3743  df-csb 3851  df-dif 3905  df-un 3907  df-in 3909  df-ss 3919  df-nul 4283  df-if 4486  df-pw 4562  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4871  df-iun 4956  df-br 5108  df-opab 5172  df-mpt 5191  df-id 5554  df-xp 5665  df-rel 5666  df-cnv 5667  df-co 5668  df-dm 5669  df-rn 5670  df-res 5671  df-ima 5672  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-f1 6542  df-fo 6543  df-f1o 6544  df-fv 6545  df-riota 7374  df-ov 7420  df-oprab 7421  df-proset 18388  df-poset 18407  df-plt 18422  df-lub 18438  df-glb 18439  df-join 18440  df-meet 18441  df-p0 18517  df-lat 18526  df-clat 18593  df-oposet 40057  df-ol 40059  df-oml 40060  df-covers 40147  df-ats 40148  df-atl 40179  df-cvlat 40203  df-hlat 40232  df-llines 40379  df-lplanes 40380  df-lvols 40381

This theorem is used by:  dalem63  40616