Theorem dalem1 40283

Description: Lemma for dath 40360. Show the lines 𝑃𝑆 and 𝑄𝑇 are different. (Contributed by NM, 9-Aug-2012.)

Hypotheses

Ref	Expression
dalema.ph	⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
dalemc.l	⊢ ≤ = (le‘𝐾)
dalemc.j	⊢ ∨ = (join‘𝐾)
dalemc.a	⊢ 𝐴 = (Atoms‘𝐾)
dalem1.o	⊢ 𝑂 = (LPlanes‘𝐾)
dalem1.y	⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)

Assertion

Ref	Expression
dalem1	⊢ (𝜑 → (𝑃 ∨ 𝑆) ≠ (𝑄 ∨ 𝑇))

Proof of Theorem dalem1

Step	Hyp	Ref	Expression
1		dalema.ph	. . 3 ⊢ (𝜑 ↔ (((𝐾 ∈ HL ∧ 𝐶 ∈ (Base‘𝐾)) ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ (𝑆 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴 ∧ 𝑈 ∈ 𝐴)) ∧ (𝑌 ∈ 𝑂 ∧ 𝑍 ∈ 𝑂) ∧ ((¬ 𝐶 ≤ (𝑃 ∨ 𝑄) ∧ ¬ 𝐶 ≤ (𝑄 ∨ 𝑅) ∧ ¬ 𝐶 ≤ (𝑅 ∨ 𝑃)) ∧ (¬ 𝐶 ≤ (𝑆 ∨ 𝑇) ∧ ¬ 𝐶 ≤ (𝑇 ∨ 𝑈) ∧ ¬ 𝐶 ≤ (𝑈 ∨ 𝑆)) ∧ (𝐶 ≤ (𝑃 ∨ 𝑆) ∧ 𝐶 ≤ (𝑄 ∨ 𝑇) ∧ 𝐶 ≤ (𝑅 ∨ 𝑈)))))
2	1	dalemclpjs 40258	. 2 ⊢ (𝜑 → 𝐶 ≤ (𝑃 ∨ 𝑆))
3	1	dalem-clpjq 40261	. . . . . 6 ⊢ (𝜑 → ¬ 𝐶 ≤ (𝑃 ∨ 𝑄))
4	3	adantr 484	. . . . 5 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → ¬ 𝐶 ≤ (𝑃 ∨ 𝑄))
5	1	dalemkehl 40247	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ HL)
6	1	dalempea 40250	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ 𝐴)
7	1	dalemsea 40253	. . . . . . . . . 10 ⊢ (𝜑 → 𝑆 ∈ 𝐴)
8		dalemc.l	. . . . . . . . . . 11 ⊢ ≤ = (le‘𝐾)
9		dalemc.j	. . . . . . . . . . 11 ⊢ ∨ = (join‘𝐾)
10		dalemc.a	. . . . . . . . . . 11 ⊢ 𝐴 = (Atoms‘𝐾)
11	8, 9, 10	hlatlej1 39999	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → 𝑃 ≤ (𝑃 ∨ 𝑆))
12	5, 6, 7, 11	syl3anc 1390	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ≤ (𝑃 ∨ 𝑆))
13	12	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → 𝑃 ≤ (𝑃 ∨ 𝑆))
14	1	dalemqea 40251	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑄 ∈ 𝐴)
15	1	dalemtea 40254	. . . . . . . . . . 11 ⊢ (𝜑 → 𝑇 ∈ 𝐴)
16	8, 9, 10	hlatlej1 39999	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑇 ∈ 𝐴) → 𝑄 ≤ (𝑄 ∨ 𝑇))
17	5, 14, 15, 16	syl3anc 1390	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄 ≤ (𝑄 ∨ 𝑇))
18	17	adantr 484	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → 𝑄 ≤ (𝑄 ∨ 𝑇))
19		simpr 488	. . . . . . . . 9 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇))
20	18, 19	breqtrrd 5128	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → 𝑄 ≤ (𝑃 ∨ 𝑆))
21	1	dalemkelat 40248	. . . . . . . . . 10 ⊢ (𝜑 → 𝐾 ∈ Lat)
22	1, 10	dalempeb 40263	. . . . . . . . . 10 ⊢ (𝜑 → 𝑃 ∈ (Base‘𝐾))
23	1, 10	dalemqeb 40264	. . . . . . . . . 10 ⊢ (𝜑 → 𝑄 ∈ (Base‘𝐾))
24		eqid 2762	. . . . . . . . . . . 12 ⊢ (Base‘𝐾) = (Base‘𝐾)
25	24, 9, 10	hlatjcl 39991	. . . . . . . . . . 11 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴) → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
26	5, 6, 7, 25	syl3anc 1390	. . . . . . . . . 10 ⊢ (𝜑 → (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))
27	24, 8, 9	latjle12 18482	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ (Base‘𝐾) ∧ 𝑄 ∈ (Base‘𝐾) ∧ (𝑃 ∨ 𝑆) ∈ (Base‘𝐾))) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
28	21, 22, 23, 26, 27	syl13anc 1391	. . . . . . . . 9 ⊢ (𝜑 → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
29	28	adantr 484	. . . . . . . 8 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → ((𝑃 ≤ (𝑃 ∨ 𝑆) ∧ 𝑄 ≤ (𝑃 ∨ 𝑆)) ↔ (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆)))
30	13, 20, 29	mpbi2and 722	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → (𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆))
31	1	dalemrea 40252	. . . . . . . . . 10 ⊢ (𝜑 → 𝑅 ∈ 𝐴)
32	1	dalemyeo 40256	. . . . . . . . . 10 ⊢ (𝜑 → 𝑌 ∈ 𝑂)
33		dalem1.o	. . . . . . . . . . 11 ⊢ 𝑂 = (LPlanes‘𝐾)
34		dalem1.y	. . . . . . . . . . 11 ⊢ 𝑌 = ((𝑃 ∨ 𝑄) ∨ 𝑅)
35	9, 10, 33, 34	lplnri1 40177	. . . . . . . . . 10 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑅 ∈ 𝐴) ∧ 𝑌 ∈ 𝑂) → 𝑃 ≠ 𝑄)
36	5, 6, 14, 31, 32, 35	syl131anc 1402	. . . . . . . . 9 ⊢ (𝜑 → 𝑃 ≠ 𝑄)
37	8, 9, 10	ps-1 40101	. . . . . . . . 9 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑃 ≠ 𝑄) ∧ (𝑃 ∈ 𝐴 ∧ 𝑆 ∈ 𝐴)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
38	5, 6, 14, 36, 6, 7, 37	syl132anc 1407	. . . . . . . 8 ⊢ (𝜑 → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
39	38	adantr 484	. . . . . . 7 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → ((𝑃 ∨ 𝑄) ≤ (𝑃 ∨ 𝑆) ↔ (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆)))
40	30, 39	mpbid 234	. . . . . 6 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → (𝑃 ∨ 𝑄) = (𝑃 ∨ 𝑆))
41	40	breq2d 5112	. . . . 5 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → (𝐶 ≤ (𝑃 ∨ 𝑄) ↔ 𝐶 ≤ (𝑃 ∨ 𝑆)))
42	4, 41	mtbid 326	. . . 4 ⊢ ((𝜑 ∧ (𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇)) → ¬ 𝐶 ≤ (𝑃 ∨ 𝑆))
43	42	ex 416	. . 3 ⊢ (𝜑 → ((𝑃 ∨ 𝑆) = (𝑄 ∨ 𝑇) → ¬ 𝐶 ≤ (𝑃 ∨ 𝑆)))
44	43	necon2ad 2972	. 2 ⊢ (𝜑 → (𝐶 ≤ (𝑃 ∨ 𝑆) → (𝑃 ∨ 𝑆) ≠ (𝑄 ∨ 𝑇)))
45	2, 44	mpd 15	1 ⊢ (𝜑 → (𝑃 ∨ 𝑆) ≠ (𝑄 ∨ 𝑇))

Syntax hints:  ¬ wn 3   → wi 4   ↔ wb 208   ∧ wa 399   ∧ w3a 1098   = wceq 1560   ∈ wcel 2142   ≠ wne 2957   class class class wbr 5100  ‘cfv 6521  (class class class)co 7396  Basecbs 17245  lecple 17293  joincjn 18343  Latclat 18463  Atomscatm 39887  HLchlt 39974  LPlanesclpl 40116

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1815  ax-4 1829  ax-5 1930  ax-6 1987  ax-7 2028  ax-8 2144  ax-9 2152  ax-10 2175  ax-11 2191  ax-12 2212  ax-ext 2734  ax-rep 5227  ax-sep 5246  ax-nul 5256  ax-pow 5322  ax-pr 5390  ax-un 7718

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1100  df-tru 1563  df-fal 1573  df-ex 1800  df-nf 1804  df-sb 2091  df-mo 2566  df-eu 2596  df-clab 2741  df-cleq 2754  df-clel 2837  df-nfc 2911  df-ne 2958  df-ral 3077  df-rex 3087  df-rmo 3367  df-reu 3368  df-rab 3415  df-v 3456  df-sbc 3745  df-csb 3853  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4481  df-pw 4557  df-sn 4583  df-pr 4585  df-op 4589  df-uni 4866  df-iun 4951  df-br 5101  df-opab 5163  df-mpt 5182  df-id 5542  df-xp 5653  df-rel 5654  df-cnv 5655  df-co 5656  df-dm 5657  df-rn 5658  df-res 5659  df-ima 5660  df-iota 6477  df-fun 6523  df-fn 6524  df-f 6525  df-f1 6526  df-fo 6527  df-f1o 6528  df-fv 6529  df-riota 7353  df-ov 7399  df-oprab 7400  df-proset 18326  df-poset 18345  df-plt 18360  df-lub 18376  df-glb 18377  df-join 18378  df-meet 18379  df-p0 18455  df-lat 18464  df-clat 18531  df-oposet 39800  df-ol 39802  df-oml 39803  df-covers 39890  df-ats 39891  df-atl 39922  df-cvlat 39946  df-hlat 39975  df-llines 40122  df-lplanes 40123

This theorem is referenced by:  dalemcea  40284  dalem2  40285