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 40047
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 2769 . . 3 (le‘𝐾) = (le‘𝐾)
3 hlhgt4.s . . 3 < = (lt‘𝐾)
4 eqid 2769 . . 3 (join‘𝐾) = (join‘𝐾)
5 hlhgt4.z . . 3 0 = (0.‘𝐾)
6 hlhgt4.u . . 3 1 = (1.‘𝐾)
7 eqid 2769 . . 3 (Atoms‘𝐾) = (Atoms‘𝐾)
81, 2, 3, 4, 5, 6, 7ishlat2 40012 . 2 (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)((𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧𝑥𝑧𝑦𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥(le‘𝐾)𝑧𝑥(le‘𝐾)(𝑧(join‘𝐾)𝑦)) → 𝑦(le‘𝐾)(𝑧(join‘𝐾)𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
9 simprr 784 . 2 (((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)((𝑥𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧𝑥𝑧𝑦𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥(le‘𝐾)𝑧𝑥(le‘𝐾)(𝑧(join‘𝐾)𝑦)) → 𝑦(le‘𝐾)(𝑧(join‘𝐾)𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))) → ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
108, 9sylbi 220 1 (𝐾 ∈ HL → ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 400  w3a 1101   = wceq 1567  wcel 2149  wne 2964  wral 3085  wrex 3095   class class class wbr 5110  cfv 6533  (class class class)co 7408  Basecbs 17265  lecple 17313  ltcplt 18360  joincjn 18363  0.cp0 18473  1.cp1 18474  CLatccla 18550  OMLcoml 39834  Atomscatm 39922  AtLatcal 39923  HLchlt 40009
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1822  ax-4 1836  ax-5 1937  ax-6 1994  ax-7 2035  ax-8 2151  ax-9 2159  ax-ext 2741
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1570  df-fal 1580  df-ex 1807  df-sb 2098  df-clab 2748  df-cleq 2761  df-clel 2844  df-ral 3086  df-rex 3096  df-rab 3424  df-v 3465  df-dif 3916  df-un 3918  df-in 3920  df-ss 3930  df-nul 4295  df-if 4490  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4874  df-br 5111  df-iota 6489  df-fv 6541  df-ov 7411  df-cvlat 39981  df-hlat 40010
This theorem is referenced by:  hlhgt2  40048  athgt  40115
  Copyright terms: Public domain W3C validator