Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > lhpmcvr | Structured version Visualization version GIF version |
Description: The meet of a lattice hyperplane with an element not under it is covered by the element. (Contributed by NM, 7-Dec-2012.) |
Ref | Expression |
---|---|
lhpmcvr.b | ⊢ 𝐵 = (Base‘𝐾) |
lhpmcvr.l | ⊢ ≤ = (le‘𝐾) |
lhpmcvr.m | ⊢ ∧ = (meet‘𝐾) |
lhpmcvr.c | ⊢ 𝐶 = ( ⋖ ‘𝐾) |
lhpmcvr.h | ⊢ 𝐻 = (LHyp‘𝐾) |
Ref | Expression |
---|---|
lhpmcvr | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑋 ∧ 𝑊)𝐶𝑋) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | hllat 36514 | . . . 4 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
2 | 1 | ad2antrr 724 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝐾 ∈ Lat) |
3 | simprl 769 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑋 ∈ 𝐵) | |
4 | lhpmcvr.b | . . . . 5 ⊢ 𝐵 = (Base‘𝐾) | |
5 | lhpmcvr.h | . . . . 5 ⊢ 𝐻 = (LHyp‘𝐾) | |
6 | 4, 5 | lhpbase 37149 | . . . 4 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ 𝐵) |
7 | 6 | ad2antlr 725 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑊 ∈ 𝐵) |
8 | lhpmcvr.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
9 | 4, 8 | latmcom 17685 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ 𝑋 ∈ 𝐵 ∧ 𝑊 ∈ 𝐵) → (𝑋 ∧ 𝑊) = (𝑊 ∧ 𝑋)) |
10 | 2, 3, 7, 9 | syl3anc 1367 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑋 ∧ 𝑊) = (𝑊 ∧ 𝑋)) |
11 | eqid 2821 | . . . . . 6 ⊢ (1.‘𝐾) = (1.‘𝐾) | |
12 | lhpmcvr.c | . . . . . 6 ⊢ 𝐶 = ( ⋖ ‘𝐾) | |
13 | 11, 12, 5 | lhp1cvr 37150 | . . . . 5 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑊𝐶(1.‘𝐾)) |
14 | 13 | adantr 483 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑊𝐶(1.‘𝐾)) |
15 | lhpmcvr.l | . . . . 5 ⊢ ≤ = (le‘𝐾) | |
16 | eqid 2821 | . . . . 5 ⊢ (join‘𝐾) = (join‘𝐾) | |
17 | 4, 15, 16, 11, 5 | lhpj1 37173 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑊(join‘𝐾)𝑋) = (1.‘𝐾)) |
18 | 14, 17 | breqtrrd 5094 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝑊𝐶(𝑊(join‘𝐾)𝑋)) |
19 | simpll 765 | . . . 4 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → 𝐾 ∈ HL) | |
20 | 4, 16, 8, 12 | cvrexch 36571 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → ((𝑊 ∧ 𝑋)𝐶𝑋 ↔ 𝑊𝐶(𝑊(join‘𝐾)𝑋))) |
21 | 19, 7, 3, 20 | syl3anc 1367 | . . 3 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → ((𝑊 ∧ 𝑋)𝐶𝑋 ↔ 𝑊𝐶(𝑊(join‘𝐾)𝑋))) |
22 | 18, 21 | mpbird 259 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑊 ∧ 𝑋)𝐶𝑋) |
23 | 10, 22 | eqbrtrd 5088 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑋 ∈ 𝐵 ∧ ¬ 𝑋 ≤ 𝑊)) → (𝑋 ∧ 𝑊)𝐶𝑋) |
Colors of variables: wff setvar class |
Syntax hints: ¬ wn 3 → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1537 ∈ wcel 2114 class class class wbr 5066 ‘cfv 6355 (class class class)co 7156 Basecbs 16483 lecple 16572 joincjn 17554 meetcmee 17555 1.cp1 17648 Latclat 17655 ⋖ ccvr 36413 HLchlt 36501 LHypclh 37135 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1911 ax-6 1970 ax-7 2015 ax-8 2116 ax-9 2124 ax-10 2145 ax-11 2161 ax-12 2177 ax-ext 2793 ax-rep 5190 ax-sep 5203 ax-nul 5210 ax-pow 5266 ax-pr 5330 ax-un 7461 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1540 df-ex 1781 df-nf 1785 df-sb 2070 df-mo 2622 df-eu 2654 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-reu 3145 df-rab 3147 df-v 3496 df-sbc 3773 df-csb 3884 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4839 df-iun 4921 df-br 5067 df-opab 5129 df-mpt 5147 df-id 5460 df-xp 5561 df-rel 5562 df-cnv 5563 df-co 5564 df-dm 5565 df-rn 5566 df-res 5567 df-ima 5568 df-iota 6314 df-fun 6357 df-fn 6358 df-f 6359 df-f1 6360 df-fo 6361 df-f1o 6362 df-fv 6363 df-riota 7114 df-ov 7159 df-oprab 7160 df-proset 17538 df-poset 17556 df-plt 17568 df-lub 17584 df-glb 17585 df-join 17586 df-meet 17587 df-p0 17649 df-p1 17650 df-lat 17656 df-clat 17718 df-oposet 36327 df-ol 36329 df-oml 36330 df-covers 36417 df-ats 36418 df-atl 36449 df-cvlat 36473 df-hlat 36502 df-lhyp 37139 |
This theorem is referenced by: lhpmcvr2 37175 lhpm0atN 37180 |
Copyright terms: Public domain | W3C validator |