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 39501
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 39419 . . 3 ((𝐾 ∈ HL ∧ 𝑋𝐵𝑋0 ) → ∃𝑝𝐴 𝑝 𝑋)
91, 2, 3, 8syl3anc 1370 . 2 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ∃𝑝𝐴 𝑝 𝑋)
10 simp1ll 1235 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝐾 ∈ HL)
114, 7atbase 39271 . . . . . . 7 (𝑝𝐴𝑝𝐵)
12113ad2ant2 1133 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝐵)
13 simp1lr 1236 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑋𝐵)
14 simp3 1137 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝 𝑋)
15 simp2 1136 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝐴)
16 simp1rr 1238 . . . . . . . 8 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ¬ 𝑋𝐴)
17 nelne2 3038 . . . . . . . 8 ((𝑝𝐴 ∧ ¬ 𝑋𝐴) → 𝑝𝑋)
1815, 16, 17syl2anc 584 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝𝑋)
19 eqid 2735 . . . . . . . . 9 (lt‘𝐾) = (lt‘𝐾)
205, 19pltval 18390 . . . . . . . 8 ((𝐾 ∈ HL ∧ 𝑝𝐴𝑋𝐵) → (𝑝(lt‘𝐾)𝑋 ↔ (𝑝 𝑋𝑝𝑋)))
2110, 15, 13, 20syl3anc 1370 . . . . . . 7 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (𝑝(lt‘𝐾)𝑋 ↔ (𝑝 𝑋𝑝𝑋)))
2214, 18, 21mpbir2and 713 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → 𝑝(lt‘𝐾)𝑋)
23 eqid 2735 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
24 eqid 2735 . . . . . . 7 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
254, 5, 19, 23, 24, 7hlrelat3 39395 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑝𝐵𝑋𝐵) ∧ 𝑝(lt‘𝐾)𝑋) → ∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋))
2610, 12, 13, 22, 25syl31anc 1372 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋))
27 simp1ll 1235 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝐾 ∈ HL)
28 simp21 1205 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑝𝐴)
29 simp23 1207 . . . . . . . . . . . 12 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑞𝐴)
304, 23, 7hlatjcl 39349 . . . . . . . . . . . 12 ((𝐾 ∈ HL ∧ 𝑝𝐴𝑞𝐴) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
3127, 28, 29, 30syl3anc 1370 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) ∈ 𝐵)
32 simp3l 1200 . . . . . . . . . . 11 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → 𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞))
33 llnle.n . . . . . . . . . . . 12 𝑁 = (LLines‘𝐾)
344, 24, 7, 33llni 39491 . . . . . . . . . . 11 (((𝐾 ∈ HL ∧ (𝑝(join‘𝐾)𝑞) ∈ 𝐵𝑝𝐴) ∧ 𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞)) → (𝑝(join‘𝐾)𝑞) ∈ 𝑁)
3527, 31, 28, 32, 34syl31anc 1372 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) ∈ 𝑁)
36 simp3r 1201 . . . . . . . . . 10 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → (𝑝(join‘𝐾)𝑞) 𝑋)
37 breq1 5151 . . . . . . . . . . 11 (𝑦 = (𝑝(join‘𝐾)𝑞) → (𝑦 𝑋 ↔ (𝑝(join‘𝐾)𝑞) 𝑋))
3837rspcev 3622 . . . . . . . . . 10 (((𝑝(join‘𝐾)𝑞) ∈ 𝑁 ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)
3935, 36, 38syl2anc 584 . . . . . . . . 9 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ (𝑝𝐴𝑝 𝑋𝑞𝐴) ∧ (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋)) → ∃𝑦𝑁 𝑦 𝑋)
40393exp 1118 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → ((𝑝𝐴𝑝 𝑋𝑞𝐴) → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))
41403expd 1352 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → (𝑝𝐴 → (𝑝 𝑋 → (𝑞𝐴 → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))))
42413imp 1110 . . . . . 6 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (𝑞𝐴 → ((𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋)))
4342rexlimdv 3151 . . . . 5 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → (∃𝑞𝐴 (𝑝( ⋖ ‘𝐾)(𝑝(join‘𝐾)𝑞) ∧ (𝑝(join‘𝐾)𝑞) 𝑋) → ∃𝑦𝑁 𝑦 𝑋))
4426, 43mpd 15 . . . 4 ((((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) ∧ 𝑝𝐴𝑝 𝑋) → ∃𝑦𝑁 𝑦 𝑋)
45443exp 1118 . . 3 (((𝐾 ∈ HL ∧ 𝑋𝐵) ∧ (𝑋0 ∧ ¬ 𝑋𝐴)) → (𝑝𝐴 → (𝑝 𝑋 → ∃𝑦𝑁 𝑦 𝑋)))
4645rexlimdv 3151 . 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 1086   = wceq 1537  wcel 2106  wne 2938  wrex 3068   class class class wbr 5148  cfv 6563  (class class class)co 7431  Basecbs 17245  lecple 17305  ltcplt 18366  joincjn 18369  0.cp0 18481  ccvr 39244  Atomscatm 39245  HLchlt 39332  LLinesclln 39474
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1792  ax-4 1806  ax-5 1908  ax-6 1965  ax-7 2005  ax-8 2108  ax-9 2116  ax-10 2139  ax-11 2155  ax-12 2175  ax-ext 2706  ax-rep 5285  ax-sep 5302  ax-nul 5312  ax-pow 5371  ax-pr 5438  ax-un 7754
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1540  df-fal 1550  df-ex 1777  df-nf 1781  df-sb 2063  df-mo 2538  df-eu 2567  df-clab 2713  df-cleq 2727  df-clel 2814  df-nfc 2890  df-ne 2939  df-ral 3060  df-rex 3069  df-rmo 3378  df-reu 3379  df-rab 3434  df-v 3480  df-sbc 3792  df-csb 3909  df-dif 3966  df-un 3968  df-in 3970  df-ss 3980  df-nul 4340  df-if 4532  df-pw 4607  df-sn 4632  df-pr 4634  df-op 4638  df-uni 4913  df-iun 4998  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5583  df-xp 5695  df-rel 5696  df-cnv 5697  df-co 5698  df-dm 5699  df-rn 5700  df-res 5701  df-ima 5702  df-iota 6516  df-fun 6565  df-fn 6566  df-f 6567  df-f1 6568  df-fo 6569  df-f1o 6570  df-fv 6571  df-riota 7388  df-ov 7434  df-oprab 7435  df-proset 18352  df-poset 18371  df-plt 18388  df-lub 18404  df-glb 18405  df-join 18406  df-meet 18407  df-p0 18483  df-lat 18490  df-clat 18557  df-oposet 39158  df-ol 39160  df-oml 39161  df-covers 39248  df-ats 39249  df-atl 39280  df-cvlat 39304  df-hlat 39333  df-llines 39481
This theorem is referenced by:  llnmlplnN  39522  lplnle  39523  llncvrlpln  39541
  Copyright terms: Public domain W3C validator