Theorem hlomcmcv 39992

Description: A Hilbert lattice is orthomodular, complete, and has the covering (exchange) property. (Contributed by NM, 5-Nov-2012.)

Assertion

Ref	Expression
hlomcmcv	⊢ (𝐾 ∈ HL → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat))

Proof of Theorem hlomcmcv

Dummy variables 𝑥 𝑦 𝑧 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2765	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2765	. . 3 ⊢ (le‘𝐾) = (le‘𝐾)
3		eqid 2765	. . 3 ⊢ (lt‘𝐾) = (lt‘𝐾)
4		eqid 2765	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
5		eqid 2765	. . 3 ⊢ (0.‘𝐾) = (0.‘𝐾)
6		eqid 2765	. . 3 ⊢ (1.‘𝐾) = (1.‘𝐾)
7		eqid 2765	. . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	ishlat1 39988	. 2 ⊢ (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)(𝑥 ≠ 𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧 ≠ 𝑥 ∧ 𝑧 ≠ 𝑦 ∧ 𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∃𝑥 ∈ (Base‘𝐾)∃𝑦 ∈ (Base‘𝐾)∃𝑧 ∈ (Base‘𝐾)(((0.‘𝐾)(lt‘𝐾)𝑥 ∧ 𝑥(lt‘𝐾)𝑦) ∧ (𝑦(lt‘𝐾)𝑧 ∧ 𝑧(lt‘𝐾)(1.‘𝐾))))))
9	8	simplbi 501	1 ⊢ (𝐾 ∈ HL → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat))

Syntax hints:   → wi 4   ∧ wa 400   ∧ w3a 1101   ∈ wcel 2145   ≠ wne 2960  ∀wral 3079  ∃wrex 3089   class class class wbr 5105  ‘cfv 6525  (class class class)co 7400  Basecbs 17259  lecple 17307  ltcplt 18354  joincjn 18357  0.cp0 18467  1.cp1 18468  CLatccla 18544  OMLcoml 39811  Atomscatm 39899  CvLatclc 39901  HLchlt 39986

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-ext 2737

This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-sb 2094  df-clab 2744  df-cleq 2757  df-clel 2840  df-ral 3080  df-rex 3090  df-rab 3418  df-v 3459  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-nul 4289  df-if 4484  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4869  df-br 5106  df-iota 6481  df-fv 6533  df-ov 7403  df-hlat 39987

This theorem is referenced by:  hloml  39993  hlclat  39994  hlcvl  39995  cvr1  40046  cvrp  40052  atcvr1  40053  atcvr2  40054