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

Theorem lplnnlelln 40740
Description: A lattice plane is not less than or equal to a lattice line. (Contributed by NM, 14-Jul-2012.)
Hypotheses
Ref Expression
lplnnlelln.l ≤ = (le‘𝐾)
lplnnlelln.n 𝑁 = (LLines‘𝐾)
lplnnlelln.p 𝑃 = (LPlanes‘𝐾)
Assertion
Ref Expression
lplnnlelln ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) → ¬ 𝑋 ≤ 𝑌)

Proof of Theorem lplnnlelln
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 lplnnlelln.n . . . . 5 𝑁 = (LLines‘𝐾)
62, 3, 4, 5islln2 40708 . . . 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 lplnnlelln.l . . . . . . . 8 ≤ = (le‘𝐾)
14 lplnnlelln.p . . . . . . . 8 𝑃 = (LPlanes‘𝐾)
1513, 3, 4, 14lplnnle2at 40738 . . . . . . 7 ((𝐾 ∈ HL ∧ (𝑋 ∈ 𝑃 ∧ 𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾))) → ¬ 𝑋 ≤ (𝑞(join‘𝐾)𝑟))
169, 10, 11, 12, 15syl13anc 1399 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾)) ∧ (𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟))) → ¬ 𝑋 ≤ (𝑞(join‘𝐾)𝑟))
17 simp3r 1221 . . . . . . 7 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾)) ∧ (𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟))) → 𝑌 = (𝑞(join‘𝐾)𝑟))
1817breq2d 5117 . . . . . 6 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾)) ∧ (𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟))) → (𝑋 ≤ 𝑌 ↔ 𝑋 ≤ (𝑞(join‘𝐾)𝑟)))
1916, 18mtbird 328 . . . . 5 (((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) ∧ (𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾)) ∧ (𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟))) → ¬ 𝑋 ≤ 𝑌)
20193exp 1137 . . . 4 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) → ((𝑞 ∈ (Atoms‘𝐾) ∧ 𝑟 ∈ (Atoms‘𝐾)) → ((𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟)) → ¬ 𝑋 ≤ 𝑌)))
2120rexlimdvv 3221 . . 3 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) → (∃𝑞 ∈ (Atoms‘𝐾)∃𝑟 ∈ (Atoms‘𝐾)(𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟)) → ¬ 𝑋 ≤ 𝑌))
2221adantld 496 . 2 ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝑃 ∧ 𝑌 ∈ 𝑁) → ((𝑌 ∈ (Base‘𝐾) ∧ ∃𝑞 ∈ (Atoms‘𝐾)∃𝑟 ∈ (Atoms‘𝐾)(𝑞 ≠ 𝑟 ∧ 𝑌 = (𝑞(join‘𝐾)𝑟))) → ¬ 𝑋 ≤ 𝑌))
238, 22mpd 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 2146   ≠ wne 2958  ∃wrex 3089   class class class wbr 5105  ‘cfv 6546  (class class class)co 7427  Basecbs 17399  lecple 17447  joincjn 18497  Atomscatm 40460  HLchlt 40547  LLinesclln 40688  LPlanesclpl 40689
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 5234  ax-sep 5251  ax-nul 5262  ax-pow 5330  ax-pr 5394  ax-un 7758
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 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rmo 3368  df-reu 3369  df-rab 3416  df-v 3455  df-sbc 3742  df-csb 3851  df-ss 3900  df-dif 4049  df-in 4093  df-un 4153  df-nul 4281  df-if 4485  df-pw 4561  df-sn 4588  df-pr 4590  df-op 4838  df-uni 4870  df-iun 4955  df-br 5106  df-opab 5170  df-mpt 5189  df-id 5549  df-xp 5660  df-rel 5661  df-cnv 5662  df-co 5663  df-dm 5664  df-rn 5665  df-res 5666  df-ima 5667  df-iota 6500  df-fun 6548  df-fn 6549  df-f 6550  df-f1 6551  df-fo 6552  df-f1o 6553  df-fv 6554  df-riota 7384  df-ov 7430  df-oprab 7431  df-proset 18480  df-poset 18499  df-plt 18514  df-lub 18530  df-glb 18531  df-join 18532  df-meet 18533  df-p0 18609  df-lat 18618  df-clat 18685  df-oposet 40373  df-ol 40375  df-oml 40376  df-covers 40463  df-ats 40464  df-atl 40495  df-cvlat 40519  df-hlat 40548  df-llines 40695  df-lplanes 40696
This theorem is used by:  lplnnelln  40743
  Copyright terms: Public domain W3C validator