Theorem hlomcmcv 40171

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 2766	. . 3 ⊢ (Base‘𝐾) = (Base‘𝐾)
2		eqid 2766	. . 3 ⊢ (le‘𝐾) = (le‘𝐾)
3		eqid 2766	. . 3 ⊢ (lt‘𝐾) = (lt‘𝐾)
4		eqid 2766	. . 3 ⊢ (join‘𝐾) = (join‘𝐾)
5		eqid 2766	. . 3 ⊢ (0.‘𝐾) = (0.‘𝐾)
6		eqid 2766	. . 3 ⊢ (1.‘𝐾) = (1.‘𝐾)
7		eqid 2766	. . 3 ⊢ (Atoms‘𝐾) = (Atoms‘𝐾)
8	1, 2, 3, 4, 5, 6, 7	ishlat1 40167	. 2 ⊢ (𝐾 ∈ HL ↔ ((𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat) ∧ (∀𝑥 ∈ (Atoms‘𝐾)∀𝑦 ∈ (Atoms‘𝐾)(𝑥 ≠ 𝑦 → ∃𝑧 ∈ (Atoms‘𝐾)(𝑧 ≠ 𝑥 ∧ 𝑧 ≠ 𝑦 ∧ 𝑧(le‘𝐾)(𝑥(join‘𝐾)𝑦))) ∧ ∃𝑥 ∈ (Base‘𝐾)∃𝑦 ∈ (Base‘𝐾)∃𝑧 ∈ (Base‘𝐾)(((0.‘𝐾)(lt‘𝐾)𝑥 ∧ 𝑥(lt‘𝐾)𝑦) ∧ (𝑦(lt‘𝐾)𝑧 ∧ 𝑧(lt‘𝐾)(1.‘𝐾))))))
9	8	simplbi 502	1 ⊢ (𝐾 ∈ HL → (𝐾 ∈ OML ∧ 𝐾 ∈ CLat ∧ 𝐾 ∈ CvLat))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   ∈ wcel 2146   ≠ wne 2961  ∀wral 3082  ∃wrex 3092   class class class wbr 5114  ‘cfv 6543  (class class class)co 7423  Basecbs 17294  lecple 17342  ltcplt 18389  joincjn 18392  0.cp0 18502  1.cp1 18503  CLatccla 18579  OMLcoml 39990  Atomscatm 40078  CvLatclc 40080  HLchlt 40165

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-ext 2738

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-sb 2100  df-clab 2745  df-cleq 2758  df-clel 2841  df-ral 3083  df-rex 3093  df-rab 3420  df-v 3460  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-nul 4290  df-if 4493  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-br 5115  df-iota 6499  df-fv 6551  df-ov 7426  df-hlat 40166

This theorem is used by:  hloml  40172  hlclat  40173  hlcvl  40174  cvr1  40225  cvrp  40231  atcvr1  40232  atcvr2  40233