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

Theorem 2llnm2N 40771
Description: The meet of two different lattice lines in a lattice plane is an atom. (Contributed by NM, 5-Jul-2012.) (New usage is discouraged.)
Hypotheses
Ref Expression
2llnm2.l ≤ = (le‘𝐾)
2llnm2.m ∧ = (meet‘𝐾)
2llnm2.a 𝐴 = (Atoms‘𝐾)
2llnm2.n 𝑁 = (LLines‘𝐾)
2llnm2.p 𝑃 = (LPlanes‘𝐾)
Assertion
Ref Expression
2llnm2N ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋 ∧ 𝑌) ∈ 𝐴)

Proof of Theorem 2llnm2N
StepHypRef Expression
1 simp22 1226 . 2 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑌 ∈ 𝑁)
2 simp1 1154 . . 3 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝐾 ∈ HL)
3 hllat 40566 . . . . 5 (𝐾 ∈ HL → 𝐾 ∈ Lat)
433ad2ant1 1151 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝐾 ∈ Lat)
5 simp21 1225 . . . . 5 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑋 ∈ 𝑁)
6 eqid 2763 . . . . . 6 (Base‘𝐾) = (Base‘𝐾)
7 2llnm2.n . . . . . 6 𝑁 = (LLines‘𝐾)
86, 7llnbase 40712 . . . . 5 (𝑋 ∈ 𝑁 → 𝑋 ∈ (Base‘𝐾))
95, 8syl 18 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑋 ∈ (Base‘𝐾))
106, 7llnbase 40712 . . . . 5 (𝑌 ∈ 𝑁 → 𝑌 ∈ (Base‘𝐾))
111, 10syl 18 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑌 ∈ (Base‘𝐾))
12 2llnm2.m . . . . 5 ∧ = (meet‘𝐾)
136, 12latmcl 18629 . . . 4 ((𝐾 ∈ Lat ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → (𝑋 ∧ 𝑌) ∈ (Base‘𝐾))
144, 9, 11, 13syl3anc 1398 . . 3 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋 ∧ 𝑌) ∈ (Base‘𝐾))
15 2llnm2.l . . . . . . 7 ≤ = (le‘𝐾)
16 eqid 2763 . . . . . . 7 (join‘𝐾) = (join‘𝐾)
17 2llnm2.p . . . . . . 7 𝑃 = (LPlanes‘𝐾)
1815, 16, 7, 172llnjN 40770 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋(join‘𝐾)𝑌) = 𝑊)
19 simp23 1227 . . . . . 6 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑊 ∈ 𝑃)
2018, 19eqeltrd 2864 . . . . 5 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋(join‘𝐾)𝑌) ∈ 𝑃)
216, 15, 16latlej1 18637 . . . . . 6 ((𝐾 ∈ Lat ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → 𝑋 ≤ (𝑋(join‘𝐾)𝑌))
224, 9, 11, 21syl3anc 1398 . . . . 5 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑋 ≤ (𝑋(join‘𝐾)𝑌))
23 eqid 2763 . . . . . 6 ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾)
2415, 23, 7, 17llncvrlpln2 40760 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑁 ∧ (𝑋(join‘𝐾)𝑌) ∈ 𝑃) ∧ 𝑋 ≤ (𝑋(join‘𝐾)𝑌)) → 𝑋( ⋖ ‘𝐾)(𝑋(join‘𝐾)𝑌))
252, 5, 20, 22, 24syl31anc 1400 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → 𝑋( ⋖ ‘𝐾)(𝑋(join‘𝐾)𝑌))
266, 16, 12, 23cvrexch 40623 . . . . 5 ((𝐾 ∈ HL ∧ 𝑋 ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) → ((𝑋 ∧ 𝑌)( ⋖ ‘𝐾)𝑌 ↔ 𝑋( ⋖ ‘𝐾)(𝑋(join‘𝐾)𝑌)))
272, 9, 11, 26syl3anc 1398 . . . 4 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → ((𝑋 ∧ 𝑌)( ⋖ ‘𝐾)𝑌 ↔ 𝑋( ⋖ ‘𝐾)(𝑋(join‘𝐾)𝑌)))
2825, 27mpbird 260 . . 3 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋 ∧ 𝑌)( ⋖ ‘𝐾)𝑌)
29 2llnm2.a . . . 4 𝐴 = (Atoms‘𝐾)
306, 23, 29, 7atcvrlln 40723 . . 3 (((𝐾 ∈ HL ∧ (𝑋 ∧ 𝑌) ∈ (Base‘𝐾) ∧ 𝑌 ∈ (Base‘𝐾)) ∧ (𝑋 ∧ 𝑌)( ⋖ ‘𝐾)𝑌) → ((𝑋 ∧ 𝑌) ∈ 𝐴 ↔ 𝑌 ∈ 𝑁))
312, 14, 11, 28, 30syl31anc 1400 . 2 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → ((𝑋 ∧ 𝑌) ∈ 𝐴 ↔ 𝑌 ∈ 𝑁))
321, 31mpbird 260 1 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑁 ∧ 𝑌 ∈ 𝑁 ∧ 𝑊 ∈ 𝑃) ∧ (𝑋 ≤ 𝑊 ∧ 𝑌 ≤ 𝑊 ∧ 𝑋 ≠ 𝑌)) → (𝑋 ∧ 𝑌) ∈ 𝐴)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ w3a 1103   = wceq 1569   ∈ wcel 2146   ≠ wne 2959   class class class wbr 5106  ‘cfv 6547  (class class class)co 7430  Basecbs 17402  lecple 17450  joincjn 18500  meetcmee 18501  Latclat 18620   ⋖ ccvr 40465  Atomscatm 40466  HLchlt 40553  LLinesclln 40694  LPlanesclpl 40695
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  df-llines 40701  df-lplanes 40702
This theorem is used by:  2llnm3N  40772
  Copyright terms: Public domain W3C validator