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 39970
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 39947 . 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 39916 . 2 ((𝐾 ∈ CvLat ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))
71, 6syl3an1 1175 1 ((𝐾 ∈ HL ∧ (𝑃𝐴𝑄𝐴𝑋𝐵) ∧ ¬ 𝑃 𝑋) → (𝑃 (𝑋 𝑄) → 𝑄 (𝑋 𝑃)))
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4  w3a 1097   = wceq 1559  wcel 2141   class class class wbr 5099  cfv 6517  (class class class)co 7392  Basecbs 17228  lecple 17276  joincjn 18326  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-cvlat 39910  df-hlat 39939
This theorem is referenced by:  cvratlem  40009  4noncolr3  40041  3dimlem4a  40051  3dimlem4OLDN  40053  ps-2  40066  4atlem0a  40181
  Copyright terms: Public domain W3C validator