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

Theorem hlhgt4 39880
Description: A Hilbert lattice has a height of at least 4. (Contributed by NM, 4-Dec-2011.)
Hypotheses
Ref Expression
hlhgt4.b 𝐵 = (Base‘𝐾)
hlhgt4.s < = (lt‘𝐾)
hlhgt4.z 0 = (0.‘𝐾)
hlhgt4.u 1 = (1.‘𝐾)
Assertion
Ref Expression
hlhgt4 (𝐾 ∈ HL → ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
Distinct variable groups:   𝑥,𝑦,𝑧,𝐵   𝑥,𝐾,𝑦,𝑧
Allowed substitution hints:   < (𝑥,𝑦,𝑧)   1 (𝑥,𝑦,𝑧)   0 (𝑥,𝑦,𝑧)

Proof of Theorem hlhgt4
StepHypRef Expression
1 hlhgt4.b . . 3 𝐵 = (Base‘𝐾)
2 eqid 2739 . . 3 (le‘𝐾) = (le‘𝐾)
3 hlhgt4.s . . 3 < = (lt‘𝐾)
4 eqid 2739 . . 3 (join‘𝐾) = (join‘𝐾)
5 hlhgt4.z . . 3 0 = (0.‘𝐾)
6 hlhgt4.u . . 3 1 = (1.‘𝐾)
7 eqid 2739 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
81, 2, 3, 4, 5, 6, 7ishlat2 39845 . 2 (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)((𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧𝑥𝑧𝑦𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥(le‘𝐾)𝑧𝑥(le‘𝐾)(𝑧(join‘𝐾)𝑦)) → 𝑦(le‘𝐾)(𝑧(join‘𝐾)𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
9 simprr 778 . 2 (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)((𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧𝑥𝑧𝑦𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥(le‘𝐾)𝑧𝑥(le‘𝐾)(𝑧(join‘𝐾)𝑦)) → 𝑦(le‘𝐾)(𝑧(join‘𝐾)𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))) → ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
108, 9sylbi 218 1 (𝐾 ∈ HL → ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 396  w3a 1092   = wceq 1547  wcel 2119  wne 2934  wral 3053  wrex 3063   class class class wbr 5072  cfv 6485  (class class class)co 7356  Basecbs 17170  lecple 17218  ltcplt 18265  joincjn 18268  0.cp0 18378  1.cp1 18379  CLatccla 18455  OMLcoml 39667  Atomscatm 39755  AtLatcal 39756  HLchlt 39842
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1802  ax-4 1816  ax-5 1917  ax-6 1974  ax-7 2015  ax-8 2121  ax-9 2129  ax-ext 2711
This theorem depends on definitions:  df-bi 208  df-an 397  df-or 854  df-3an 1094  df-tru 1550  df-fal 1560  df-ex 1787  df-sb 2074  df-clab 2718  df-cleq 2731  df-clel 2814  df-ral 3054  df-rex 3064  df-rab 3392  df-v 3433  df-dif 3886  df-un 3888  df-in 3890  df-ss 3900  df-nul 4262  df-if 4455  df-sn 4556  df-pr 4558  df-op 4562  df-uni 4839  df-br 5073  df-iota 6441  df-fv 6493  df-ov 7359  df-cvlat 39814  df-hlat 39843
This theorem is referenced by:  hlhgt2  39881  athgt  39948
  Copyright terms: Public domain W3C validator