Theorem atlelt 40641

Description: Transfer less-than relation from one atom to another. (Contributed by NM, 7-May-2012.)

Hypotheses

Ref	Expression
atlelt.b	⊢ 𝐵 = (Base‘𝐾)
atlelt.l	⊢ ≤ = (le‘𝐾)
atlelt.s	⊢ < = (lt‘𝐾)
atlelt.a	⊢ 𝐴 = (Atoms‘𝐾)

Assertion

Ref	Expression
atlelt	⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑃 < 𝑋)

Proof of Theorem atlelt

Step	Hyp	Ref	Expression
1		simp3r 1221	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑄 < 𝑋)
2		breq1 5109	. . 3 ⊢ (𝑃 = 𝑄 → (𝑃 < 𝑋 ↔ 𝑄 < 𝑋))
3	1, 2	syl5ibrcom 250	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃 = 𝑄 → 𝑃 < 𝑋))
4		simp1 1154	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝐾 ∈ HL)
5		simp21 1225	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑃 ∈ 𝐴)
6		simp22 1226	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑄 ∈ 𝐴)
7		atlelt.s	. . . . 5 ⊢ < = (lt‘𝐾)
8		eqid 2763	. . . . 5 ⊢ (join‘𝐾) = (join‘𝐾)
9		atlelt.a	. . . . 5 ⊢ 𝐴 = (Atoms‘𝐾)
10	7, 8, 9	atlt 40640	. . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴) → (𝑃 < (𝑃(join‘𝐾)𝑄) ↔ 𝑃 ≠ 𝑄))
11	4, 5, 6, 10	syl3anc 1398	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃 < (𝑃(join‘𝐾)𝑄) ↔ 𝑃 ≠ 𝑄))
12		simp3l 1220	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑃 ≤ 𝑋)
13		simp23 1227	. . . . . . 7 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑋 ∈ 𝐵)
14	4, 6, 13	3jca 1146	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵))
15		atlelt.l	. . . . . . 7 ⊢ ≤ = (le‘𝐾)
16	15, 7	pltle 18520	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (𝑄 < 𝑋 → 𝑄 ≤ 𝑋))
17	14, 1, 16	sylc 66	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑄 ≤ 𝑋)
18		hllat 40566	. . . . . . 7 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat)
19	18	3ad2ant1 1151	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝐾 ∈ Lat)
20		atlelt.b	. . . . . . . 8 ⊢ 𝐵 = (Base‘𝐾)
21	20, 9	atbase 40492	. . . . . . 7 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵)
22	5, 21	syl 18	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑃 ∈ 𝐵)
23	20, 9	atbase 40492	. . . . . . 7 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵)
24	6, 23	syl 18	. . . . . 6 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑄 ∈ 𝐵)
25	20, 15, 8	latjle12 18639	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ (𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ≤ 𝑋 ∧ 𝑄 ≤ 𝑋) ↔ (𝑃(join‘𝐾)𝑄) ≤ 𝑋))
26	19, 22, 24, 13, 25	syl13anc 1399	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → ((𝑃 ≤ 𝑋 ∧ 𝑄 ≤ 𝑋) ↔ (𝑃(join‘𝐾)𝑄) ≤ 𝑋))
27	12, 17, 26	mpbi2and 725	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃(join‘𝐾)𝑄) ≤ 𝑋)
28		hlpos 40569	. . . . . 6 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Poset)
29	28	3ad2ant1 1151	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝐾 ∈ Poset)
30	20, 8	latjcl 18628	. . . . . 6 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃(join‘𝐾)𝑄) ∈ 𝐵)
31	19, 22, 24, 30	syl3anc 1398	. . . . 5 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃(join‘𝐾)𝑄) ∈ 𝐵)
32	20, 15, 7	pltletr 18530	. . . . 5 ⊢ ((𝐾 ∈ Poset ∧ (𝑃 ∈ 𝐵 ∧ (𝑃(join‘𝐾)𝑄) ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 < (𝑃(join‘𝐾)𝑄) ∧ (𝑃(join‘𝐾)𝑄) ≤ 𝑋) → 𝑃 < 𝑋))
33	29, 22, 31, 13, 32	syl13anc 1399	. . . 4 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → ((𝑃 < (𝑃(join‘𝐾)𝑄) ∧ (𝑃(join‘𝐾)𝑄) ≤ 𝑋) → 𝑃 < 𝑋))
34	27, 33	mpan2d 707	. . 3 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃 < (𝑃(join‘𝐾)𝑄) → 𝑃 < 𝑋))
35	11, 34	sylbird 263	. 2 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → (𝑃 ≠ 𝑄 → 𝑃 < 𝑋))
36	3, 35	pm2.61dne 3045	1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ≤ 𝑋 ∧ 𝑄 < 𝑋)) → 𝑃 < 𝑋)

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ≠ wne 2959   class class class wbr 5106  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  lecple 17450  Posetcpo 18496  ltcplt 18497  joincjn 18500  Latclat 18620  Atomscatm 40466  HLchlt 40553

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1827  ax-4 1841  ax-5 1944  ax-6 2001  ax-7 2042  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2196  ax-12 2215  ax-ext 2735  ax-rep 5235  ax-sep 5252  ax-nul 5263  ax-pow 5331  ax-pr 5395  ax-un 7761

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1572  df-fal 1582  df-ex 1812  df-nf 1816  df-sb 2101  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5171  df-mpt 5190  df-id 5550  df-xp 5661  df-rel 5662  df-cnv 5663  df-co 5664  df-dm 5665  df-rn 5666  df-res 5667  df-ima 5668  df-iota 6501  df-fun 6549  df-fn 6550  df-f 6551  df-f1 6552  df-fo 6553  df-f1o 6554  df-fv 6555  df-riota 7387  df-ov 7433  df-oprab 7434  df-proset 18483  df-poset 18502  df-plt 18517  df-lub 18533  df-glb 18534  df-join 18535  df-meet 18536  df-p0 18612  df-lat 18621  df-clat 18688  df-oposet 40379  df-ol 40381  df-oml 40382  df-covers 40469  df-ats 40470  df-atl 40501  df-cvlat 40525  df-hlat 40554

This theorem is used by:  1cvratlt  40677