Theorem llncmp 40021

Description: If two lattice lines are comparable, they are equal. (Contributed by NM, 19-Jun-2012.)

Hypotheses

Ref	Expression
llncmp.l	⊢ ≤ = (le‘𝐾)
llncmp.n	⊢ 𝑁 = (LLines‘𝐾)

Assertion

Ref	Expression
llncmp	⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))

Proof of Theorem llncmp

Dummy variable 𝑝 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		simp2 1143	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → 𝑋 ∈ 𝑁)
2		simp1 1142	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → 𝐾 ∈ HL)
3		eqid 2740	. . . . . . 7 ⊢ (Base‘𝐾) = (Base‘𝐾)
4		llncmp.n	. . . . . . 7 ⊢ 𝑁 = (LLines‘𝐾)
5	3, 4	llnbase 40008	. . . . . 6 ⊢ (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝐾))
6	5	3ad2ant2 1140	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → 𝑋 ∈ (Base‘𝐾))
7		eqid 2740	. . . . . 6 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
8		eqid 2740	. . . . . 6 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
9	3, 7, 8, 4	islln4 40006	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ (Base‘𝐾)) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)𝑝( ⋖ ‘𝐾)𝑋))
10	2, 6, 9	syl2anc 590	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑋 ∈ 𝑁 ↔ ∃𝑝 ∈ (Atoms‘𝐾)𝑝( ⋖ ‘𝐾)𝑋))
11	1, 10	mpbid 233	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → ∃𝑝 ∈ (Atoms‘𝐾)𝑝( ⋖ ‘𝐾)𝑋)
12		simpr3 1203	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑋 ≤ 𝑌)
13		hlpos 39865	. . . . . . . . 9 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Poset)
14	13	3ad2ant1 1139	. . . . . . . 8 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → 𝐾 ∈ Poset)
15	14	adantr 481	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝐾 ∈ Poset)
16	6	adantr 481	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑋 ∈ (Base‘𝐾))
17		simpl3 1200	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑌 ∈ 𝑁)
18	3, 4	llnbase 40008	. . . . . . . 8 ⊢ (𝑌 ∈ 𝑁 → 𝑌 ∈ (Base‘𝐾))
19	17, 18	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑌 ∈ (Base‘𝐾))
20		simpr1 1201	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝 ∈ (Atoms‘𝐾))
21	3, 8	atbase 39788	. . . . . . . 8 ⊢ (𝑝 ∈ (Atoms‘𝐾) → 𝑝 ∈ (Base‘𝐾))
22	20, 21	syl 17	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝 ∈ (Base‘𝐾))
23		simpr2 1202	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝( ⋖ ‘𝐾)𝑋)
24		simpl1 1198	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝐾 ∈ HL)
25		llncmp.l	. . . . . . . . . . 11 ⊢ ≤ = (le‘𝐾)
26	3, 25, 7	cvrle 39777	. . . . . . . . . 10 ⊢ (((𝐾 ∈ HL ∧ 𝑝 ∈ (Base‘𝐾) ∧ 𝑋 ∈ (Base‘𝐾)) ∧ 𝑝( ⋖ ‘𝐾)𝑋) → 𝑝 ≤ 𝑋)
27	24, 22, 16, 23, 26	syl31anc 1381	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝 ≤ 𝑋)
28	3, 25	postr 18284	. . . . . . . . . 10 ⊢ ((𝐾 ∈ Poset ∧ (𝑝 ∈ (Base‘𝐾) ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾))) → ((𝑝 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) → 𝑝 ≤ 𝑌))
29	15, 22, 16, 19, 28	syl13anc 1380	. . . . . . . . 9 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → ((𝑝 ≤ 𝑋 ∧ 𝑋 ≤ 𝑌) → 𝑝 ≤ 𝑌))
30	27, 12, 29	mp2and 705	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝 ≤ 𝑌)
31	25, 7, 8, 4	atcvrlln2 40018	. . . . . . . 8 ⊢ (((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑌 ∈ 𝑁) ∧ 𝑝 ≤ 𝑌) → 𝑝( ⋖ ‘𝐾)𝑌)
32	24, 20, 17, 30, 31	syl31anc 1381	. . . . . . 7 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑝( ⋖ ‘𝐾)𝑌)
33	3, 25, 7	cvrcmp 39782	. . . . . . 7 ⊢ ((𝐾 ∈ Poset ∧ (𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾) ∧ 𝑝 ∈ (Base‘𝐾)) ∧ (𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑝( ⋖ ‘𝐾)𝑌)) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))
34	15, 16, 19, 22, 23, 32, 33	syl132anc 1396	. . . . . 6 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))
35	12, 34	mpbid 233	. . . . 5 ⊢ (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝( ⋖ ‘𝐾)𝑋 ∧ 𝑋 ≤ 𝑌)) → 𝑋 = 𝑌)
36	35	3exp2 1361	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑝 ∈ (Atoms‘𝐾) → (𝑝( ⋖ ‘𝐾)𝑋 → (𝑋 ≤ 𝑌 → 𝑋 = 𝑌))))
37	36	rexlimdv 3139	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (∃𝑝 ∈ (Atoms‘𝐾)𝑝( ⋖ ‘𝐾)𝑋 → (𝑋 ≤ 𝑌 → 𝑋 = 𝑌)))
38	11, 37	mpd 15	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑋 ≤ 𝑌 → 𝑋 = 𝑌))
39	3, 25	posref 18282	. . . 4 ⊢ ((𝐾 ∈ Poset ∧ 𝑋 ∈ (Base‘𝐾)) → 𝑋 ≤ 𝑋)
40	14, 6, 39	syl2anc 590	. . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → 𝑋 ≤ 𝑋)
41		breq2 5083	. . 3 ⊢ (𝑋 = 𝑌 → (𝑋 ≤ 𝑋 ↔ 𝑋 ≤ 𝑌))
42	40, 41	syl5ibcom 246	. 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑋 = 𝑌 → 𝑋 ≤ 𝑌))
43	38, 42	impbid 213	1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁) → (𝑋 ≤ 𝑌 ↔ 𝑋 = 𝑌))

Syntax hints:   → wi 4   ↔ wb 207   ∧ wa 396   ∧ w3a 1092   = wceq 1547   ∈ wcel 2119  ∃wrex 3064   class class class wbr 5079  ‘cfv 6492  Basecbs 17177  lecple 17225  Posetcpo 18271   ⋖ ccvr 39761  Atomscatm 39762  HLchlt 39849  LLinesclln 39990

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-10 2152  ax-11 2168  ax-12 2189  ax-ext 2712  ax-rep 5206  ax-sep 5225  ax-nul 5235  ax-pow 5301  ax-pr 5369  ax-un 7685

This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-nf 1791  df-sb 2074  df-mo 2543  df-eu 2573  df-clab 2719  df-cleq 2732  df-clel 2815  df-nfc 2889  df-ne 2936  df-ral 3055  df-rex 3065  df-rmo 3345  df-reu 3346  df-rab 3393  df-v 3434  df-sbc 3731  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-nul 4269  df-if 4462  df-pw 4538  df-sn 4563  df-pr 4565  df-op 4569  df-uni 4846  df-iun 4930  df-br 5080  df-opab 5142  df-mpt 5161  df-id 5520  df-xp 5631  df-rel 5632  df-cnv 5633  df-co 5634  df-dm 5635  df-rn 5636  df-res 5637  df-ima 5638  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7320  df-ov 7366  df-oprab 7367  df-proset 18258  df-poset 18277  df-plt 18292  df-lub 18308  df-glb 18309  df-join 18310  df-meet 18311  df-p0 18387  df-lat 18396  df-clat 18463  df-oposet 39675  df-ol 39677  df-oml 39678  df-covers 39765  df-ats 39766  df-atl 39797  df-cvlat 39821  df-hlat 39850  df-llines 39997

This theorem is referenced by:  llnnlt  40022  2llnmat  40023  llnmlplnN  40038  dalem16  40178  dalem60  40231  llnexchb2  40368