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 39458
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 39307 . . 3 (𝑃𝐴𝑃𝐵)
4 eqid 2735 . . . 4 (le‘𝐾) = (le‘𝐾)
5 2atomslt.s . . . 4 < = (lt‘𝐾)
6 eqid 2735 . . . 4 (join‘𝐾) = (join‘𝐾)
71, 4, 5, 6, 2hlrelat 39421 . . 3 (((𝐾 ∈ HL ∧ 𝑃𝐵𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋))
83, 7syl3anl2 1415 . 2 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋))
9 simp3l 1202 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃 < (𝑃(join‘𝐾)𝑞))
10 simp1l1 1267 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ HL)
11 simp1l2 1268 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝐴)
12 simp2 1137 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝐴)
13 eqid 2735 . . . . . . . . . 10 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
145, 6, 2, 13atltcvr 39454 . . . . . . . . 9 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑃𝐴𝑞𝐴)) → (𝑃 < (𝑃(join‘𝐾)𝑞) ↔ 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1510, 11, 11, 12, 14syl13anc 1374 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃 < (𝑃(join‘𝐾)𝑞) ↔ 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
169, 15mpbid 232 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞))
176, 13, 2atcvr1 39436 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑃𝐴𝑞𝐴) → (𝑃𝑞𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1810, 11, 12, 17syl3anc 1373 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃𝑞𝑃( ⋖ ‘𝐾)(𝑃(join‘𝐾)𝑞)))
1916, 18mpbird 257 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝑞)
2019necomd 2987 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝑃)
215, 6, 2atlt 39456 . . . . . . . . 9 ((𝐾 ∈ HL ∧ 𝑞𝐴𝑃𝐴) → (𝑞 < (𝑞(join‘𝐾)𝑃) ↔ 𝑞𝑃))
2210, 12, 11, 21syl3anc 1373 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑞 < (𝑞(join‘𝐾)𝑃) ↔ 𝑞𝑃))
2320, 22mpbird 257 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < (𝑞(join‘𝐾)𝑃))
2410hllatd 39382 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ Lat)
2511, 3syl 17 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑃𝐵)
261, 2atbase 39307 . . . . . . . . 9 (𝑞𝐴𝑞𝐵)
27263ad2ant2 1134 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞𝐵)
281, 6latjcom 18457 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑃𝐵𝑞𝐵) → (𝑃(join‘𝐾)𝑞) = (𝑞(join‘𝐾)𝑃))
2924, 25, 27, 28syl3anc 1373 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞) = (𝑞(join‘𝐾)𝑃))
3023, 29breqtrrd 5147 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < (𝑃(join‘𝐾)𝑞))
31 simp3r 1203 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)
32 hlpos 39384 . . . . . . . 8 (𝐾 ∈ HL → 𝐾 ∈ Poset)
3310, 32syl 17 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝐾 ∈ Poset)
341, 6latjcl 18449 . . . . . . . 8 ((𝐾 ∈ Lat ∧ 𝑃𝐵𝑞𝐵) → (𝑃(join‘𝐾)𝑞) ∈ 𝐵)
3524, 25, 27, 34syl3anc 1373 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑃(join‘𝐾)𝑞) ∈ 𝐵)
36 simp1l3 1269 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑋𝐵)
371, 4, 5pltletr 18353 . . . . . . 7 ((𝐾 ∈ Poset ∧ (𝑞𝐵 ∧ (𝑃(join‘𝐾)𝑞) ∈ 𝐵𝑋𝐵)) → ((𝑞 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑞 < 𝑋))
3833, 27, 35, 36, 37syl13anc 1374 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → ((𝑞 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → 𝑞 < 𝑋))
3930, 31, 38mp2and 699 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → 𝑞 < 𝑋)
4020, 39jca 511 . . . 4 ((((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) ∧ 𝑞𝐴 ∧ (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋)) → (𝑞𝑃𝑞 < 𝑋))
41403exp 1119 . . 3 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → (𝑞𝐴 → ((𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → (𝑞𝑃𝑞 < 𝑋))))
4241reximdvai 3151 . 2 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → (∃𝑞𝐴 (𝑃 < (𝑃(join‘𝐾)𝑞) ∧ (𝑃(join‘𝐾)𝑞)(le‘𝐾)𝑋) → ∃𝑞𝐴 (𝑞𝑃𝑞 < 𝑋)))
438, 42mpd 15 1 (((𝐾 ∈ HL ∧ 𝑃𝐴𝑋𝐵) ∧ 𝑃 < 𝑋) → ∃𝑞𝐴 (𝑞𝑃𝑞 < 𝑋))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 206  wa 395  w3a 1086   = wceq 1540  wcel 2108  wne 2932  wrex 3060   class class class wbr 5119  cfv 6531  (class class class)co 7405  Basecbs 17228  lecple 17278  Posetcpo 18319  ltcplt 18320  joincjn 18323  Latclat 18441  ccvr 39280  Atomscatm 39281  HLchlt 39368
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2157  ax-12 2177  ax-ext 2707  ax-rep 5249  ax-sep 5266  ax-nul 5276  ax-pow 5335  ax-pr 5402  ax-un 7729
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2539  df-eu 2568  df-clab 2714  df-cleq 2727  df-clel 2809  df-nfc 2885  df-ne 2933  df-ral 3052  df-rex 3061  df-rmo 3359  df-reu 3360  df-rab 3416  df-v 3461  df-sbc 3766  df-csb 3875  df-dif 3929  df-un 3931  df-in 3933  df-ss 3943  df-nul 4309  df-if 4501  df-pw 4577  df-sn 4602  df-pr 4604  df-op 4608  df-uni 4884  df-iun 4969  df-br 5120  df-opab 5182  df-mpt 5202  df-id 5548  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6484  df-fun 6533  df-fn 6534  df-f 6535  df-f1 6536  df-fo 6537  df-f1o 6538  df-fv 6539  df-riota 7362  df-ov 7408  df-oprab 7409  df-proset 18306  df-poset 18325  df-plt 18340  df-lub 18356  df-glb 18357  df-join 18358  df-meet 18359  df-p0 18435  df-lat 18442  df-clat 18509  df-oposet 39194  df-ol 39196  df-oml 39197  df-covers 39284  df-ats 39285  df-atl 39316  df-cvlat 39340  df-hlat 39369
This theorem is referenced by:  cdlemb  39813  lhpexle1  40027
  Copyright terms: Public domain W3C validator