| 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 784 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ¬ 𝑃 ≤ 𝑊) | |
| 2 | hlatl 40162 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ AtLat) | |
| 3 | 2 | ad2antrr 738 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ AtLat) |
| 4 | simprl 782 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴) | |
| 5 | eqid 2762 | . . . . 5 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 6 | lhpmat.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 7 | 5, 6 | lhpbase 40800 | . . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾)) |
| 8 | 7 | ad2antlr 739 | . . 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 40119 | . . 3 ⊢ ((𝐾 ∈ AtLat ∧ 𝑃 ∈ 𝐴 ∧ 𝑊 ∈ (Base‘𝐾)) → (¬ 𝑃 ≤ 𝑊 ↔ (𝑃 ∧ 𝑊) = 0 )) |
| 14 | 3, 4, 8, 13 | syl3anc 1397 | . 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 400 = wceq 1569 ∈ wcel 2142 class class class wbr 5108 ‘cfv 6536 (class class class)co 7412 Basecbs 17275 lecple 17323 meetcmee 18374 0.cp0 18483 Atomscatm 40065 AtLatcal 40066 HLchlt 40152 LHypclh 40786 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1824 ax-4 1838 ax-5 1939 ax-6 1996 ax-7 2037 ax-8 2144 ax-9 2152 ax-10 2175 ax-11 2191 ax-12 2212 ax-ext 2734 ax-rep 5237 ax-sep 5256 ax-nul 5268 ax-pow 5335 ax-pr 5403 ax-un 7734 |
| This proof depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1104 df-tru 1572 df-fal 1582 df-ex 1809 df-nf 1813 df-sb 2096 df-mo 2566 df-eu 2596 df-clab 2741 df-cleq 2754 df-clel 2837 df-nfc 2911 df-ne 2958 df-ral 3079 df-rex 3089 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3456 df-sbc 3744 df-csb 3853 df-dif 3907 df-un 3909 df-in 3911 df-ss 3921 df-nul 4286 df-if 4487 df-pw 4563 df-sn 4589 df-pr 4591 df-op 4595 df-uni 4872 df-iun 4957 df-br 5109 df-opab 5173 df-mpt 5192 df-id 5555 df-xp 5666 df-rel 5667 df-cnv 5668 df-co 5669 df-dm 5670 df-rn 5671 df-res 5672 df-ima 5673 df-iota 6492 df-fun 6538 df-fn 6539 df-f 6540 df-f1 6541 df-fo 6542 df-f1o 6543 df-fv 6544 df-riota 7369 df-ov 7415 df-oprab 7416 df-proset 18356 df-poset 18375 df-plt 18390 df-lub 18406 df-glb 18407 df-join 18408 df-meet 18409 df-p0 18485 df-lat 18494 df-covers 40068 df-ats 40069 df-atl 40100 df-cvlat 40124 df-hlat 40153 df-lhyp 40790 |
| This theorem is used by: lhpmatb 40833 lhp2at0 40834 lhpelim 40839 lhple 40844 idltrn 40952 ltrnmw 40953 trl0 40972 cdleme0e 41019 cdleme2 41030 cdleme7c 41047 cdleme22d 41145 cdlemefrs29pre00 41197 cdlemefrs29bpre0 41198 cdlemefrs29cpre1 41200 cdleme32fva 41239 cdleme35d 41254 cdleme42ke 41287 cdlemeg46frv 41327 cdleme50trn3 41355 cdlemg2fv2 41402 cdlemg8a 41429 cdlemg10bALTN 41438 cdlemh2 41618 cdlemk9 41641 cdlemk9bN 41642 dia2dimlem1 41866 dihvalcqat 42041 dihjatc1 42113 |
| Copyright terms: Public domain | W3C validator |