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 37373 | . 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 37342 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
7 | 1, 6 | syl3an1 1162 | 1 ⊢ ((𝐾 ∈ HL ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2106 class class class wbr 5074 ‘cfv 6433 (class class class)co 7275 Basecbs 16912 lecple 16969 joincjn 18029 Atomscatm 37277 CvLatclc 37279 HLchlt 37364 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1798 ax-4 1812 ax-5 1913 ax-6 1971 ax-7 2011 ax-8 2108 ax-9 2116 ax-ext 2709 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1783 df-sb 2068 df-clab 2716 df-cleq 2730 df-clel 2816 df-ral 3069 df-rex 3070 df-rab 3073 df-v 3434 df-dif 3890 df-un 3892 df-in 3894 df-ss 3904 df-nul 4257 df-if 4460 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4840 df-br 5075 df-iota 6391 df-fv 6441 df-ov 7278 df-cvlat 37336 df-hlat 37365 |
This theorem is referenced by: cvratlem 37435 4noncolr3 37467 3dimlem4a 37477 3dimlem4OLDN 37479 ps-2 37492 4atlem0a 37607 |
Copyright terms: Public domain | W3C validator |