| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > cvlexch3 | Structured version Visualization version GIF version | ||
| Description: An atomic covering lattice has the exchange property. (atexch 32468 analog.) (Contributed by NM, 5-Nov-2012.) |
| Ref | Expression |
|---|---|
| cvlexch3.b | ⊢ 𝐵 = (Base‘𝐾) |
| cvlexch3.l | ⊢ ≤ = (le‘𝐾) |
| cvlexch3.j | ⊢ ∨ = (join‘𝐾) |
| cvlexch3.m | ⊢ ∧ = (meet‘𝐾) |
| cvlexch3.z | ⊢ 0 = (0.‘𝐾) |
| cvlexch3.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| Ref | Expression |
|---|---|
| cvlexch3 | ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | cvlatl 39695 | . . . . 5 ⊢ (𝐾 ∈ CvLat → 𝐾 ∈ AtLat) | |
| 2 | 1 | adantr 480 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → 𝐾 ∈ AtLat) |
| 3 | simpr1 1196 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → 𝑃 ∈ 𝐴) | |
| 4 | simpr3 1198 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → 𝑋 ∈ 𝐵) | |
| 5 | cvlexch3.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
| 6 | cvlexch3.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
| 7 | cvlexch3.m | . . . . 5 ⊢ ∧ = (meet‘𝐾) | |
| 8 | cvlexch3.z | . . . . 5 ⊢ 0 = (0.‘𝐾) | |
| 9 | cvlexch3.a | . . . . 5 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 10 | 5, 6, 7, 8, 9 | atnle 39687 | . . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 )) |
| 11 | 2, 3, 4, 10 | syl3anc 1374 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 )) |
| 12 | cvlexch3.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 13 | 5, 6, 12, 9 | cvlexch1 39698 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| 14 | 13 | 3expia 1122 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → (¬ 𝑃 ≤ 𝑋 → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃)))) |
| 15 | 11, 14 | sylbird 260 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ∧ 𝑋) = 0 → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃)))) |
| 16 | 15 | 3impia 1118 | 1 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1542 ∈ wcel 2114 class class class wbr 5100 ‘cfv 6500 (class class class)co 7368 Basecbs 17148 lecple 17196 joincjn 18246 meetcmee 18247 0.cp0 18356 Atomscatm 39633 AtLatcal 39634 CvLatclc 39635 |
| 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 2709 ax-rep 5226 ax-sep 5243 ax-nul 5253 ax-pow 5312 ax-pr 5379 ax-un 7690 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-ral 3053 df-rex 3063 df-rmo 3352 df-reu 3353 df-rab 3402 df-v 3444 df-sbc 3743 df-csb 3852 df-dif 3906 df-un 3908 df-in 3910 df-ss 3920 df-nul 4288 df-if 4482 df-pw 4558 df-sn 4583 df-pr 4585 df-op 4589 df-uni 4866 df-iun 4950 df-br 5101 df-opab 5163 df-mpt 5182 df-id 5527 df-xp 5638 df-rel 5639 df-cnv 5640 df-co 5641 df-dm 5642 df-rn 5643 df-res 5644 df-ima 5645 df-iota 6456 df-fun 6502 df-fn 6503 df-f 6504 df-f1 6505 df-fo 6506 df-f1o 6507 df-fv 6508 df-riota 7325 df-ov 7371 df-oprab 7372 df-proset 18229 df-poset 18248 df-plt 18263 df-lub 18279 df-glb 18280 df-join 18281 df-meet 18282 df-p0 18358 df-lat 18367 df-covers 39636 df-ats 39637 df-atl 39668 df-cvlat 39692 |
| This theorem is referenced by: hlexch3 39761 |
| Copyright terms: Public domain | W3C validator |