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

Theorem ishlatiN 36506
Description: Properties that determine a Hilbert lattice. (Contributed by NM, 13-Nov-2011.) (New usage is discouraged.)
Hypotheses
Ref Expression
ishlati.1 𝐾 ∈ OML
ishlati.2 𝐾 ∈ CLat
ishlati.3 𝐾 ∈ AtLat
ishlati.b 𝐵 = (Base‘𝐾)
ishlati.l = (le‘𝐾)
ishlati.s < = (lt‘𝐾)
ishlati.j = (join‘𝐾)
ishlati.z 0 = (0.‘𝐾)
ishlati.u 1 = (1.‘𝐾)
ishlati.a 𝐴 = (Atoms‘𝐾)
ishlati.9 𝑥𝐴𝑦𝐴 ((𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥 𝑧𝑥 (𝑧 𝑦)) → 𝑦 (𝑧 𝑥)))
ishlati.10 𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))
Assertion
Ref Expression
ishlatiN 𝐾 ∈ HL
Distinct variable groups:   𝑥,𝑦,𝑧,𝐴   𝑥,𝐵,𝑦,𝑧   𝑥,𝐾,𝑦,𝑧
Allowed substitution hints:   < (𝑥,𝑦,𝑧)   1 (𝑥,𝑦,𝑧)   (𝑥,𝑦,𝑧)   (𝑥,𝑦,𝑧)   0 (𝑥,𝑦,𝑧)

Proof of Theorem ishlatiN
StepHypRef Expression
1 ishlati.1 . . 3 𝐾 ∈ OML
2 ishlati.2 . . 3 𝐾 ∈ CLat
3 ishlati.3 . . 3 𝐾 ∈ AtLat
41, 2, 33pm3.2i 1335 . 2 (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat)
5 ishlati.9 . . 3 𝑥𝐴𝑦𝐴 ((𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥 𝑧𝑥 (𝑧 𝑦)) → 𝑦 (𝑧 𝑥)))
6 ishlati.10 . . 3 𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 ))
75, 6pm3.2i 473 . 2 (∀𝑥𝐴𝑦𝐴 ((𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥 𝑧𝑥 (𝑧 𝑦)) → 𝑦 (𝑧 𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))
8 ishlati.b . . 3 𝐵 = (Base‘𝐾)
9 ishlati.l . . 3 = (le‘𝐾)
10 ishlati.s . . 3 < = (lt‘𝐾)
11 ishlati.j . . 3 = (join‘𝐾)
12 ishlati.z . . 3 0 = (0.‘𝐾)
13 ishlati.u . . 3 1 = (1.‘𝐾)
14 ishlati.a . . 3 𝐴 = (Atoms‘𝐾)
158, 9, 10, 11, 12, 13, 14ishlat2 36504 . 2 (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ AtLat) ∧ (∀𝑥𝐴𝑦𝐴 ((𝑥𝑦 → ∃𝑧𝐴 (𝑧𝑥𝑧𝑦𝑧 (𝑥 𝑦))) ∧ ∀𝑧𝐵 ((¬ 𝑥 𝑧𝑥 (𝑧 𝑦)) → 𝑦 (𝑧 𝑥))) ∧ ∃𝑥𝐵𝑦𝐵𝑧𝐵 (( 0 < 𝑥𝑥 < 𝑦) ∧ (𝑦 < 𝑧𝑧 < 1 )))))
164, 7, 15mpbir2an 709 1 𝐾 ∈ HL
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  wa 398  w3a 1083   = wceq 1537  wcel 2114  wne 3016  wral 3138  wrex 3139   class class class wbr 5066  cfv 6355  (class class class)co 7156  Basecbs 16483  lecple 16572  ltcplt 17551  joincjn 17554  0.cp0 17647  1.cp1 17648  CLatccla 17717  OMLcoml 36326  Atomscatm 36414  AtLatcal 36415  HLchlt 36501
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2793
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-clab 2800  df-cleq 2814  df-clel 2893  df-nfc 2963  df-ral 3143  df-rex 3144  df-rab 3147  df-v 3496  df-dif 3939  df-un 3941  df-in 3943  df-ss 3952  df-nul 4292  df-if 4468  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4839  df-br 5067  df-iota 6314  df-fv 6363  df-ov 7159  df-cvlat 36473  df-hlat 36502
This theorem is referenced by: (None)
  Copyright terms: Public domain W3C validator