| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lhpmat | Structured version Visualization version GIF version | ||
| Description: An element covered by the lattice unity, when conjoined with an atom not under it, equals the lattice zero. (Contributed by NM, 6-Jun-2012.) |
| Ref | Expression |
|---|---|
| lhpmat.l | ⊢ ≤ = (le‘𝐾) |
| lhpmat.m | ⊢ ∧ = (meet‘𝐾) |
| lhpmat.z | ⊢ 0 = (0.‘𝐾) |
| lhpmat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| lhpmat.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| Ref | Expression |
|---|---|
| lhpmat | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∧ 𝑊) = 0 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simprr 785 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ¬ 𝑃 ≤ 𝑊) | |
| 2 | hlatl 40385 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
| 3 | 2 | ad2antrr 739 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ AtLat) |
| 4 | simprl 783 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴) | |
| 5 | eqid 2761 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 6 | lhpmat.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | 5, 6 | lhpbase 41023 | . . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾)) |
| 8 | 7 | ad2antlr 740 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾)) |
| 9 | lhpmat.l | . . . 4 ⊢ ≤ = (le‘𝐾) | |
| 10 | lhpmat.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 11 | lhpmat.z | . . . 4 ⊢ 0 = (0.‘𝐾) | |
| 12 | lhpmat.a | . . . 4 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 13 | 5, 9, 10, 11, 12 | atnle 40342 | . . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑊 ∈ (Base‘𝐾)) → (¬ 𝑃 ≤ 𝑊 ↔ (𝑃 ∧ 𝑊) = 0 )) |
| 14 | 3, 4, 8, 13 | syl3anc 1398 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (¬ 𝑃 ≤ 𝑊 ↔ (𝑃 ∧ 𝑊) = 0 )) |
| 15 | 1, 14 | mpbid 235 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑃 ∧ 𝑊) = 0 ) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: ¬ wn 3 → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1570 ∈ wcel 2145 class class class wbr 5103 ‘cfv 6531 (class class class)co 7412 Basecbs 17367 lecple 17415 meetcmee 18466 0.cp0 18575 Atomscatm 40288 AtLatcal 40289 HLchlt 40375 LHypclh 41009 |
| 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 df-hlat 40376 df-lhyp 41013 |
| This theorem is used by: lhpmatb 41056 lhp2at0 41057 lhpelim 41062 lhple 41067 idltrn 41175 ltrnmw 41176 trl0 41195 cdleme0e 41242 cdleme2 41253 cdleme7c 41270 cdleme22d 41368 cdlemefrs29pre00 41420 cdlemefrs29bpre0 41421 cdlemefrs29cpre1 41423 cdleme32fva 41462 cdleme35d 41477 cdleme42ke 41510 cdlemeg46frv 41550 cdleme50trn3 41578 cdlemg2fv2 41625 cdlemg8a 41652 cdlemg10bALTN 41661 cdlemh2 41841 cdlemk9 41864 cdlemk9bN 41865 dia2dimlem1 42089 dihvalcqat 42264 dihjatc1 42336 |
| Copyright terms: Public domain | W3C validator |