| 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 40510 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
| 3 | 2 | ad2antrr 739 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ AtLat) |
| 4 | simprl 783 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴) | |
| 5 | eqid 2760 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 6 | lhpmat.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | 5, 6 | lhpbase 41148 | . . . 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 40467 | . . 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 1569 ∈ wcel 2144 class class class wbr 5102 ‘cfv 6538 (class class class)co 7420 Basecbs 17392 lecple 17440 meetcmee 18491 0.cp0 18600 Atomscatm 40413 AtLatcal 40414 HLchlt 40500 LHypclh 41134 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7751 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-id 5545 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-iota 6494 df-fun 6540 df-fn 6541 df-f 6542 df-f1 6543 df-fo 6544 df-f1o 6545 df-fv 6546 df-riota 7377 df-ov 7423 df-oprab 7424 df-proset 18473 df-poset 18492 df-plt 18507 df-lub 18523 df-glb 18524 df-join 18525 df-meet 18526 df-p0 18602 df-lat 18611 df-covers 40416 df-ats 40417 df-atl 40448 df-cvlat 40472 df-hlat 40501 df-lhyp 41138 |
| This theorem is used by: lhpmatb 41181 lhp2at0 41182 lhpelim 41187 lhple 41192 idltrn 41300 ltrnmw 41301 trl0 41320 cdleme0e 41367 cdleme2 41378 cdleme7c 41395 cdleme22d 41493 cdlemefrs29pre00 41545 cdlemefrs29bpre0 41546 cdlemefrs29cpre1 41548 cdleme32fva 41587 cdleme35d 41602 cdleme42ke 41635 cdlemeg46frv 41675 cdleme50trn3 41703 cdlemg2fv2 41750 cdlemg8a 41777 cdlemg10bALTN 41786 cdlemh2 41966 cdlemk9 41989 cdlemk9bN 41990 dia2dimlem1 42214 dihvalcqat 42389 dihjatc1 42461 |
| Copyright terms: Public domain | W3C validator |