Theorem hlomcmcv 39944

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

Syntax hints:   → wi 4   ∧ wa 399   ∧ w3a 1097   ∈ wcel 2141   ≠ wne 2956  ∀wral 3075  ∃wrex 3085   class class class wbr 5099  ‘cfv 6517  (class class class)co 7392  Basecbs 17228  lecple 17276  ltcplt 18323  joincjn 18326  0.cp0 18436  1.cp1 18437  CLatccla 18513  OMLcoml 39763  Atomscatm 39851  CvLatclc 39853  HLchlt 39938

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1814  ax-4 1828  ax-5 1929  ax-6 1986  ax-7 2027  ax-8 2143  ax-9 2151  ax-ext 2733

This theorem depends on definitions:  df-bi 209  df-an 400  df-or 859  df-3an 1099  df-tru 1562  df-fal 1572  df-ex 1799  df-sb 2090  df-clab 2740  df-cleq 2753  df-clel 2836  df-ral 3076  df-rex 3086  df-rab 3414  df-v 3455  df-dif 3907  df-un 3909  df-in 3911  df-ss 3921  df-nul 4286  df-if 4480  df-sn 4582  df-pr 4584  df-op 4588  df-uni 4865  df-br 5100  df-iota 6473  df-fv 6525  df-ov 7395  df-hlat 39939

This theorem is referenced by:  hloml  39945  hlclat  39946  hlcvl  39947  cvr1  39998  cvrp  40004  atcvr1  40005  atcvr2  40006