![]() |
Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
|
Mirrors > Home > MPE Home > Th. List > Mathboxes > hlexch1 | Structured version Visualization version GIF version |
Description: A Hilbert lattice has the exchange property. (Contributed by NM, 13-Nov-2011.) |
Ref | Expression |
---|---|
hlsuprexch.b | ⊢ 𝐵 = (Base‘𝐾) |
hlsuprexch.l | ⊢ ≤ = (le‘𝐾) |
hlsuprexch.j | ⊢ ∨ = (join‘𝐾) |
hlsuprexch.a | ⊢ 𝐴 = (Atoms‘𝐾) |
Ref | Expression |
---|---|
hlexch1 | ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hlcvl 39315 | . 2 ⊢ (𝐾 ∈ HL → 𝐾 ∈ CvLat) | |
2 | hlsuprexch.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
3 | hlsuprexch.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
4 | hlsuprexch.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
5 | hlsuprexch.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
6 | 2, 3, 4, 5 | cvlexch1 39284 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
7 | 1, 6 | syl3an1 1163 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1087 = wceq 1537 ∈ wcel 2108 class class class wbr 5166 ‘cfv 6573 (class class class)co 7448 Basecbs 17258 lecple 17318 joincjn 18381 Atomscatm 39219 CvLatclc 39221 HLchlt 39306 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-ext 2711 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-sb 2065 df-clab 2718 df-cleq 2732 df-clel 2819 df-ral 3068 df-rex 3077 df-rab 3444 df-v 3490 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-nul 4353 df-if 4549 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-br 5167 df-iota 6525 df-fv 6581 df-ov 7451 df-cvlat 39278 df-hlat 39307 |
This theorem is referenced by: cvratlem 39378 4noncolr3 39410 3dimlem4a 39420 3dimlem4OLDN 39422 ps-2 39435 4atlem0a 39550 |
Copyright terms: Public domain | W3C validator |