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

Theorem hlexch1 40018
Description: A Hilbert lattice has the exchange property. (Contributed by NM, 13-Nov-2011.)
Hypotheses
Ref Expression
hlsuprexch.b 𝐵 = (Base‘𝐾)
hlsuprexch.l = (le‘𝐾)
hlsuprexch.j = (join‘𝐾)
hlsuprexch.a 𝐴 = (Atoms‘𝐾)
Assertion
Ref Expression
hlexch1 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))

Proof of Theorem hlexch1
StepHypRef Expression
1 hlcvl 39995 . 2 (𝐾 ∈ HL → 𝐾 ∈ CvLat)
2 hlsuprexch.b . . 3 𝐵 = (Base‘𝐾)
3 hlsuprexch.l . . 3 = (le‘𝐾)
4 hlsuprexch.j . . 3 = (join‘𝐾)
5 hlsuprexch.a . . 3 𝐴 = (Atoms‘𝐾)
62, 3, 4, 5cvlexch1 39964 . 2 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))
71, 6syl3an1 1179 1 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  w3a 1101   = wceq 1563  wcel 2145   class class class wbr 5105  cfv 6525  (class class class)co 7400  Basecbs 17259  lecple 17307  joincjn 18357  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-cvlat 39958  df-hlat 39987
This theorem is referenced by:  cvratlem  40057  4noncolr3  40089  3dimlem4a  40099  3dimlem4OLDN  40101  ps-2  40114  4atlem0a  40229
  Copyright terms: Public domain W3C validator