| 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 32965 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 40350 | . . . . 5 ⊢ (𝐾 ∈ CvLat → 𝐾 ∈ AtLat) | |
| 2 | 1 | adantr 486 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → 𝐾 ∈ AtLat) |
| 3 | simpr1 1213 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → 𝑃 ∈ 𝐴) | |
| 4 | simpr3 1215 | . . . 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 40342 | . . . 4 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 )) |
| 11 | 2, 3, 4, 10 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → (¬ 𝑃 ≤ 𝑋 ↔ (𝑃 ∧ 𝑋) = 0 )) |
| 12 | cvlexch3.j | . . . . 5 ⊢ ∨ = (join‘𝐾) | |
| 13 | 5, 6, 12, 9 | cvlexch1 40353 | . . . 4 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ ¬ 𝑃 ≤ 𝑋) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| 14 | 13 | 3expia 1139 | . . 3 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → (¬ 𝑃 ≤ 𝑋 → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃)))) |
| 15 | 11, 14 | sylbird 263 | . 2 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵)) → ((𝑃 ∧ 𝑋) = 0 → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃)))) |
| 16 | 15 | 3impia 1135 | 1 ⊢ ((𝐾 ∈ CvLat ∧ (𝑃 ∈ 𝐴 ∧ 𝑄 ∈ 𝐴 ∧ 𝑋 ∈ 𝐵) ∧ (𝑃 ∧ 𝑋) = 0 ) → (𝑃 ≤ (𝑋 ∨ 𝑄) → 𝑄 ≤ (𝑋 ∨ 𝑃))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 lecple 17415 joincjn 18465 meetcmee 18466 0.cp0 18575 Atomscatm 40288 AtLatcal 40289 CvLatclc 40290 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2733 ax-rep 5232 ax-sep 5249 ax-nul 5260 ax-pow 5327 ax-pr 5391 ax-un 7740 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2565 df-eu 2595 df-clab 2740 df-cleq 2753 df-clel 2836 df-nfc 2910 df-ne 2957 df-ral 3078 df-rex 3088 df-rmo 3366 df-reu 3367 df-rab 3414 df-v 3453 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5546 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6487 df-fun 6533 df-fn 6534 df-f 6535 df-f1 6536 df-fo 6537 df-f1o 6538 df-fv 6539 df-riota 7369 df-ov 7415 df-oprab 7416 df-proset 18448 df-poset 18467 df-plt 18482 df-lub 18498 df-glb 18499 df-join 18500 df-meet 18501 df-p0 18577 df-lat 18586 df-covers 40291 df-ats 40292 df-atl 40323 df-cvlat 40347 |
| This theorem is used by: hlexch3 40416 |
| Copyright terms: Public domain | W3C validator |