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

Theorem lvolnlelln 40735
Description: A lattice line cannot majorize a lattice volume. (Contributed by NM, 14-Jul-2012.)
Hypotheses
Ref Expression
lvolnlelln.l ≤ = (le‘𝐾)
lvolnlelln.n 𝑁 = (LLines‘𝐾)
lvolnlelln.v 𝑉 = (LVols‘𝐾)
Assertion
Ref Expression
lvolnlelln ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → ¬ 𝑋 ≤ 𝑌)

Proof of Theorem lvolnlelln
Dummy variables 𝑞 𝑝 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 simp3 1156 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → 𝑌 ∈ 𝑁)
2 eqid 2760 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
3 eqid 2760 . . . . 5 (join‘𝐾) = (join‘𝐾)
4 eqid 2760 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
5 lvolnlelln.n . . . . 5 𝑁 = (LLines‘𝐾)
62, 3, 4, 5islln2 40662 . . . 4 (𝐾 ∈ HL → (𝑌 ∈ 𝑁 ↔ (𝑌 ∈ (Base‘𝐾) ∧ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞)))))
763ad2ant1 1151 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → (𝑌 ∈ 𝑁 ↔ (𝑌 ∈ (Base‘𝐾) ∧ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞)))))
81, 7mpbid 235 . 2 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → (𝑌 ∈ (Base‘𝐾) ∧ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))))
9 simp11 1222 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝐾 ∈ HL)
10 simp12 1223 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑋 ∈ 𝑉)
11 simp2l 1218 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑝 ∈ (Atoms‘𝐾))
12 simp2r 1219 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑞 ∈ (Atoms‘𝐾))
13 lvolnlelln.l . . . . . . . 8 ≤ = (le‘𝐾)
14 lvolnlelln.v . . . . . . . 8 𝑉 = (LVols‘𝐾)
1513, 3, 4, 14lvolnle3at 40733 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ¬ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
169, 10, 11, 11, 12, 15syl23anc 1404 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ¬ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
17 simp3r 1221 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑌 = (𝑝(join‘𝐾)𝑞))
183, 4hlatjidm 40520 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
199, 11, 18syl2anc 596 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → (𝑝(join‘𝐾)𝑝) = 𝑝)
2019oveq1d 7436 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞) = (𝑝(join‘𝐾)𝑞))
2117, 20eqtr4d 2798 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑌 = ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
2221breq2d 5114 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞)))
2316, 22mtbird 328 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ¬ 𝑋 ≤ 𝑌)
24233exp 1137 . . . 4 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → ((𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞)) → ¬ 𝑋 ≤ 𝑌)))
2524rexlimdvv 3218 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → (∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞)) → ¬ 𝑋 ≤ 𝑌))
2625adantld 496 . 2 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → ((𝑌 ∈ (Base‘𝐾) ∧ ∃𝑝 ∈ (Atoms‘𝐾)∃𝑞 ∈ (Atoms‘𝐾)(𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ¬ 𝑋 ≤ 𝑌))
278, 26mpd 16 1 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → ¬ 𝑋 ≤ 𝑌)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1569   ∈ wcel 2144   ≠ wne 2955  ∃wrex 3086   class class class wbr 5102  ‘cfv 6539  (class class class)co 7421  Basecbs 17393  lecple 17441  joincjn 18491  Atomscatm 40414  HLchlt 40501  LLinesclln 40642  LVolsclvol 40644
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 1942  ax-6 1999  ax-7 2040  ax-8 2146  ax-9 2154  ax-10 2177  ax-11 2193  ax-12 2212  ax-ext 2732  ax-rep 5231  ax-sep 5248  ax-nul 5259  ax-pow 5326  ax-pr 5390  ax-un 7752
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 2099  df-mo 2564  df-eu 2594  df-clab 2739  df-cleq 2752  df-clel 2835  df-nfc 2909  df-ne 2956  df-ral 3077  df-rex 3087  df-rmo 3365  df-reu 3366  df-rab 3413  df-v 3452  df-sbc 3739  df-csb 3847  df-ss 3896  df-dif 4047  df-in 4091  df-un 4151  df-nul 4279  df-if 4482  df-pw 4558  df-sn 4585  df-pr 4587  df-op 4835  df-uni 4867  df-iun 4952  df-br 5103  df-opab 5167  df-mpt 5186  df-id 5545  df-xp 5656  df-rel 5657  df-cnv 5658  df-co 5659  df-dm 5660  df-rn 5661  df-res 5662  df-ima 5663  df-iota 6494  df-fun 6541  df-fn 6542  df-f 6543  df-f1 6544  df-fo 6545  df-f1o 6546  df-fv 6547  df-riota 7378  df-ov 7424  df-oprab 7425  df-proset 18474  df-poset 18493  df-plt 18508  df-lub 18524  df-glb 18525  df-join 18526  df-meet 18527  df-p0 18603  df-lat 18612  df-clat 18679  df-oposet 40327  df-ol 40329  df-oml 40330  df-covers 40417  df-ats 40418  df-atl 40449  df-cvlat 40473  df-hlat 40502  df-llines 40649  df-lplanes 40650  df-lvols 40651
This theorem is used by:  lvolnelln  40740
  Copyright terms: Public domain W3C validator