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

Theorem llnle 39520
Description: Any element greater than 0 and not an atom majorizes a lattice line. (Contributed by NM, 28-Jun-2012.)
Hypotheses
Ref Expression
llnle.b 𝐵 = (Base‘𝐾)
llnle.l = (le‘𝐾)
llnle.z 0 = (0.‘𝐾)
llnle.a 𝐴 = (Atoms‘𝐾)
llnle.n 𝑁 = (LLines‘𝐾)
Assertion
Ref Expression
llnle (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ∃𝑦𝑁 𝑦 𝑋)
Distinct variable groups:   𝑦,𝐾   𝑦,   𝑦,𝑁   𝑦,𝑋
Allowed substitution hints:   𝐴(𝑦)   𝐵(𝑦)   0 (𝑦)

Proof of Theorem llnle
Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simpll 767 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → 𝐾 ∈ HL)
2 simplr 769 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → 𝑋𝐵)
3 simprl 771 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → 𝑋0 )
4 llnle.b . . . 4 𝐵 = (Base‘𝐾)
5 llnle.l . . . 4 = (le‘𝐾)
6 llnle.z . . . 4 0 = (0.‘𝐾)
7 llnle.a . . . 4 𝐴 = (Atoms‘𝐾)
84, 5, 6, 7atle 39438 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝐵𝑋0 ) → ∃𝑝𝐴 𝑝 𝑋)
91, 2, 3, 8syl3anc 1373 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ∃𝑝𝐴 𝑝 𝑋)
10 simp1ll 1237 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝐾 ∈ HL)
114, 7atbase 39290 . . . . . . 7 (𝑝𝐴𝑝𝐵)
12113ad2ant2 1135 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝐵)
13 simp1lr 1238 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑋𝐵)
14 simp3 1139 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝 𝑋)
15 simp2 1138 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝐴)
16 simp1rr 1240 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ¬ 𝑋𝐴)
17 nelne2 3040 . . . . . . . 8 ((𝑝𝐴 ∧ ¬ 𝑋𝐴) → 𝑝𝑋)
1815, 16, 17syl2anc 584 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝑋)
19 eqid 2737 . . . . . . . . 9 (lt‘𝐾) = (lt‘𝐾)
205, 19pltval 18377 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑝𝐴𝑋𝐵) → (𝑝(lt‘𝐾)𝑋 ↔ (𝑝 𝑋𝑝𝑋)))
2110, 15, 13, 20syl3anc 1373 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (𝑝(lt‘𝐾)𝑋 ↔ (𝑝 𝑋𝑝𝑋)))
2214, 18, 21mpbir2and 713 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝(lt‘𝐾)𝑋)
23 eqid 2737 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
24 eqid 2737 . . . . . . 7 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
254, 5, 19, 23, 24, 7hlrelat3 39414 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑝𝐵𝑋𝐵) ∧ 𝑝(lt‘𝐾)𝑋) → ∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋))
2610, 12, 13, 22, 25syl31anc 1375 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋))
27 simp1ll 1237 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝐾 ∈ HL)
28 simp21 1207 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑝𝐴)
29 simp23 1209 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑞𝐴)
304, 23, 7hlatjcl 39368 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝𝐴𝑞𝐴) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
3127, 28, 29, 30syl3anc 1373 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
32 simp3l 1202 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞))
33 llnle.n . . . . . . . . . . . 12 𝑁 = (LLines‘𝐾)
344, 24, 7, 33llni 39510 . . . . . . . . . . 11 (((𝐾 ∈ HL ∧ (𝑝(join‘𝐾)𝑞) ∈ 𝐵𝑝𝐴) ∧ 𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞)) → (𝑝(join‘𝐾)𝑞) ∈ 𝑁)
3527, 31, 28, 32, 34syl31anc 1375 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) ∈ 𝑁)
36 simp3r 1203 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) 𝑋)
37 breq1 5146 . . . . . . . . . . 11 (𝑦 = (𝑝(join‘𝐾)𝑞) → (𝑦 𝑋 ↔ (𝑝(join‘𝐾)𝑞) 𝑋))
3837rspcev 3622 . . . . . . . . . 10 (((𝑝(join‘𝐾)𝑞) ∈ 𝑁 ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)
3935, 36, 38syl2anc 584 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → ∃𝑦𝑁 𝑦 𝑋)
40393exp 1120 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ((𝑝𝐴𝑝 𝑋𝑞𝐴) → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))
41403expd 1354 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → (𝑝𝐴 → (𝑝 𝑋 → (𝑞𝐴 → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))))
42413imp 1111 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (𝑞𝐴 → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))
4342rexlimdv 3153 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋))
4426, 43mpd 15 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ∃𝑦𝑁 𝑦 𝑋)
45443exp 1120 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → (𝑝𝐴 → (𝑝 𝑋 → ∃𝑦𝑁 𝑦 𝑋)))
4645rexlimdv 3153 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → (∃𝑝𝐴 𝑝 𝑋 → ∃𝑦𝑁 𝑦 𝑋))
479, 46mpd 15 1 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ∃𝑦𝑁 𝑦 𝑋)
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wb 206  wa 395  w3a 1087   = wceq 1540  wcel 2108  wne 2940  wrex 3070   class class class wbr 5143  cfv 6561  (class class class)co 7431  Basecbs 17247  lecple 17304  ltcplt 18354  joincjn 18357  0.cp0 18468  ccvr 39263  Atomscatm 39264  HLchlt 39351  LLinesclln 39493
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 2708  ax-rep 5279  ax-sep 5296  ax-nul 5306  ax-pow 5365  ax-pr 5432  ax-un 7755
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3an 1089  df-tru 1543  df-fal 1553  df-ex 1780  df-nf 1784  df-sb 2065  df-mo 2540  df-eu 2569  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2892  df-ne 2941  df-ral 3062  df-rex 3071  df-rmo 3380  df-reu 3381  df-rab 3437  df-v 3482  df-sbc 3789  df-csb 3900  df-dif 3954  df-un 3956  df-in 3958  df-ss 3968  df-nul 4334  df-if 4526  df-pw 4602  df-sn 4627  df-pr 4629  df-op 4633  df-uni 4908  df-iun 4993  df-br 5144  df-opab 5206  df-mpt 5226  df-id 5578  df-xp 5691  df-rel 5692  df-cnv 5693  df-co 5694  df-dm 5695  df-rn 5696  df-res 5697  df-ima 5698  df-iota 6514  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7388  df-ov 7434  df-oprab 7435  df-proset 18340  df-poset 18359  df-plt 18375  df-lub 18391  df-glb 18392  df-join 18393  df-meet 18394  df-p0 18470  df-lat 18477  df-clat 18544  df-oposet 39177  df-ol 39179  df-oml 39180  df-covers 39267  df-ats 39268  df-atl 39299  df-cvlat 39323  df-hlat 39352  df-llines 39500
This theorem is referenced by:  llnmlplnN  39541  lplnle  39542  llncvrlpln  39560
  Copyright terms: Public domain W3C validator