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 40844
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 2763 . . . . 5 (Base‘𝐾) = (Base‘𝐾)
3 eqid 2763 . . . . 5 (join‘𝐾) = (join‘𝐾)
4 eqid 2763 . . . . 5 (Atoms‘𝐾) = (Atoms‘𝐾)
5 lvolnlelln.n . . . . 5 𝑁 = (LLines‘𝐾)
62, 3, 4, 5islln2 40771 . . . 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 40842 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾))) → ¬ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
169, 10, 11, 11, 12, 15syl23anc 1405 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ¬ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
17 simp3r 1221 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑌 = (𝑝(join‘𝐾)𝑞))
183, 4hlatjidm 40629 . . . . . . . . . 10 ((𝐾 ∈ HL ∧ 𝑝 ∈ (Atoms‘𝐾)) → (𝑝(join‘𝐾)𝑝) = 𝑝)
199, 11, 18syl2anc 596 . . . . . . . . 9 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → (𝑝(join‘𝐾)𝑝) = 𝑝)
2019oveq1d 7461 . . . . . . . 8 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞) = (𝑝(join‘𝐾)𝑞))
2117, 20eqtr4d 2801 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → 𝑌 = ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞))
2221breq2d 5118 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ ((𝑝(join‘𝐾)𝑝)(join‘𝐾)𝑞)))
2316, 22mtbird 328 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) ∧ (𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) ∧ (𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞))) → ¬ 𝑋 ≤ 𝑌)
24233exp 1137 . . . 4 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑉 ∧ 𝑌 ∈ 𝑁) → ((𝑝 ∈ (Atoms‘𝐾) ∧ 𝑞 ∈ (Atoms‘𝐾)) → ((𝑝 ≠ 𝑞 ∧ 𝑌 = (𝑝(join‘𝐾)𝑞)) → ¬ 𝑋 ≤ 𝑌)))
2524rexlimdvv 3222 . . 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 1570   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   class class class wbr 5106  ‘cfv 6561  (class class class)co 7446  Basecbs 17419  lecple 17467  joincjn 18517  Atomscatm 40523  HLchlt 40610  LLinesclln 40751  LVolsclvol 40753
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-rep 5236  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7778
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  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 5172  df-mpt 5191  df-id 5551  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-iota 6515  df-fun 6563  df-fn 6564  df-f 6565  df-f1 6566  df-fo 6567  df-f1o 6568  df-fv 6569  df-riota 7403  df-ov 7449  df-oprab 7450  df-proset 18500  df-poset 18519  df-plt 18534  df-lub 18550  df-glb 18551  df-join 18552  df-meet 18553  df-p0 18629  df-lat 18638  df-clat 18705  df-oposet 40436  df-ol 40438  df-oml 40439  df-covers 40526  df-ats 40527  df-atl 40558  df-cvlat 40582  df-hlat 40611  df-llines 40758  df-lplanes 40759  df-lvols 40760
This theorem is used by:  lvolnelln  40849
  Copyright terms: Public domain W3C validator