Users' Mathboxes Mathbox for Norm Megill < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >   Mathboxes  >  2atlt Structured version   Visualization version   GIF version

Theorem 2atlt 40063
Description: Given an atom less than an element, there is another atom less than the element. (Contributed by NM, 6-May-2012.)
Hypotheses
Ref Expression
2atomslt.b 𝐵 = (Base‘𝐾)
2atomslt.s < = (lt‘𝐾)
2atomslt.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
2atlt (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑞𝑃𝑞 < 𝑋))
Distinct variable groups:   𝐴,𝑞   𝐵,𝑞   𝐾,𝑞   𝑃,𝑞   < ,𝑞   𝑋,𝑞

Proof of Theorem 2atlt
StepHypRef Expression
1 2atomslt.b . . . 4 𝐵 = (Base‘𝐾)
2 2atomslt.a . . . 4 𝐴 = (Atoms‘𝐾)
31, 2atbase 39913 . . 3 (𝑃𝐴𝑃𝐵)
4 eqid 2762 . . . 4 (le‘𝐾) = (le‘𝐾)
5 2atomslt.s . . . 4 < = (lt‘𝐾)
6 eqid 2762 . . . 4 (join‘𝐾) = (join‘𝐾)
71, 4, 5, 6, 2hlrelat 40026 . . 3 (((𝐾 ∈ HL ∧ 𝑃𝐵𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋))
83, 7syl3anl2 1432 . 2 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋))
9 simp3l 1215 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃 < (𝑃(join‘𝐾)𝑞))
10 simp1l1 1280 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ HL)
11 simp1l2 1281 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝐴)
12 simp2 1150 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝐴)
13 eqid 2762 . . . . . . . . . 10 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
145, 6, 2, 13atltcvr 40059 . . . . . . . . 9 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑃𝐴𝑞𝐴)) → (𝑃 < (𝑃(join‘𝐾)𝑞) ↔ 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1510, 11, 11, 12, 14syl13anc 1391 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃 < (𝑃(join‘𝐾)𝑞) ↔ 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
169, 15mpbid 234 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞))
176, 13, 2atcvr1 40041 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑃𝐴𝑞𝐴) → (𝑃𝑞𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1810, 11, 12, 17syl3anc 1390 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃𝑞𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1916, 18mpbird 259 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝑞)
2019necomd 3012 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝑃)
215, 6, 2atlt 40061 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑞𝐴𝑃𝐴) → (𝑞 < (𝑞(join‘𝐾)𝑃) ↔ 𝑞𝑃))
2210, 12, 11, 21syl3anc 1390 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑞 < (𝑞(join‘𝐾)𝑃) ↔ 𝑞𝑃))
2320, 22mpbird 259 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < (𝑞(join‘𝐾)𝑃))
2410hllatd 39988 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ Lat)
2511, 3syl 17 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝐵)
261, 2atbase 39913 . . . . . . . . 9 (𝑞𝐴𝑞𝐵)
27263ad2ant2 1147 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝐵)
281, 6latjcom 18479 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑃𝐵𝑞𝐵) → (𝑃(join‘𝐾)𝑞) = (𝑞(join‘𝐾)𝑃))
2924, 25, 27, 28syl3anc 1390 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞) = (𝑞(join‘𝐾)𝑃))
3023, 29breqtrrd 5128 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < (𝑃(join‘𝐾)𝑞))
31 simp3r 1216 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)
32 hlpos 39990 . . . . . . . 8 (𝐾 ∈ HL → 𝐾 ∈ Poset)
3310, 32syl 17 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ Poset)
341, 6latjcl 18471 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑃𝐵𝑞𝐵) → (𝑃(join‘𝐾)𝑞) ∈ 𝐵)
3524, 25, 27, 34syl3anc 1390 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞) ∈ 𝐵)
36 simp1l3 1282 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑋𝐵)
371, 4, 5pltletr 18373 . . . . . . 7 ((𝐾 ∈ Poset ∧ (𝑞𝐵 ∧ (𝑃(join‘𝐾)𝑞) ∈ 𝐵𝑋𝐵)) → ((𝑞 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑞 < 𝑋))
3833, 27, 35, 36, 37syl13anc 1391 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → ((𝑞 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑞 < 𝑋))
3930, 31, 38mp2and 709 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < 𝑋)
4020, 39jca 519 . . . 4 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑞𝑃𝑞 < 𝑋))
41403exp 1132 . . 3 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → (𝑞𝐴 → ((𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → (𝑞𝑃𝑞 < 𝑋))))
4241reximdvai 3173 . 2 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → (∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → ∃𝑞𝐴 (𝑞𝑃𝑞 < 𝑋)))
438, 42mpd 15 1 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑞𝑃𝑞 < 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 399  w3a 1098   = wceq 1560  wcel 2142  wne 2957  wrex 3086   class class class wbr 5100  cfv 6521  (class class class)co 7396  Basecbs 17245  lecple 17293  Posetcpo 18339  ltcplt 18340  joincjn 18343  Latclat 18463  ccvr 39886  Atomscatm 39887  HLchlt 39974
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
This theorem is referenced by:  cdlemb  40418  lhpexle1  40632
  Copyright terms: Public domain W3C validator