| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cvlexch2 | Structured version Visualization version GIF version | ||
| Description: An atomic covering lattice has the exchange property. (Contributed by NM, 6-May-2012.) |
| Ref | Expression |
|---|---|
| cvlexch.b | ⊢ 𝐵 = (Base‘𝐾) |
| cvlexch.l | ⊢ ≤ = (le‘𝐾) |
| cvlexch.j | ⊢ ∨ = (join‘𝐾) |
| cvlexch.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| cvlexch2 | ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑄 ∨ 𝑋) → 𝑄 ≤ (𝑃 ∨ 𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cvlexch.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | cvlexch.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 3 | cvlexch.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 4 | cvlexch.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 5 | 1, 2, 3, 4 | cvlexch1 39774 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| 6 | cvllat 39772 | . . . . 5 ⊢ (𝐾 ∈ CvLat → 𝐾 ∈ Lat) | |
| 7 | 6 | 3ad2ant1 1134 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝐾 ∈ Lat) |
| 8 | simp22 1209 | . . . . 5 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝑄 ∈ 𝐴) | |
| 9 | 1, 4 | atbase 39735 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 10 | 8, 9 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝑄 ∈ 𝐵) |
| 11 | simp23 1210 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 3 | latjcom 18413 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 13 | 7, 10, 11, 12 | syl3anc 1374 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 14 | 13 | breq2d 5097 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑄 ∨ 𝑋) ↔ 𝑃 ≤ (𝑋 ∨ 𝑄))) |
| 15 | simp21 1208 | . . . . 5 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝑃 ∈ 𝐴) | |
| 16 | 1, 4 | atbase 39735 | . . . . 5 ⊢ (𝑃 ∈ 𝐴 → 𝑃 ∈ 𝐵) |
| 17 | 15, 16 | syl 17 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → 𝑃 ∈ 𝐵) |
| 18 | 1, 3 | latjcom 18413 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑃 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑃 ∨ 𝑋) = (𝑋 ∨ 𝑃)) |
| 19 | 7, 17, 11, 18 | syl3anc 1374 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ∨ 𝑋) = (𝑋 ∨ 𝑃)) |
| 20 | 19 | breq2d 5097 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑄 ≤ (𝑃 ∨ 𝑋) ↔ 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| 21 | 5, 14, 20 | 3imtr4d 294 | 1 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑄 ∨ 𝑋) → 𝑄 ≤ (𝑃 ∨ 𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5085 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 lecple 17227 joincjn 18277 Latclat 18397 Atomscatm 39709 CvLatclc 39711 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-lub 18310 df-join 18312 df-lat 18398 df-ats 39713 df-atl 39744 df-cvlat 39768 |
| This theorem is referenced by: hlexch2 39829 |
| Copyright terms: Public domain | W3C validator |