| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > lhpjat1 | Structured version Visualization version GIF version | ||
| Description: The join of a co-atom (hyperplane) and an atom not under it is the lattice unity. (Contributed by NM, 18-May-2012.) |
| Ref | Expression |
|---|---|
| lhpjat.l | ⊢ ≤ = (le‘𝐾) |
| lhpjat.j | ⊢ ∨ = (join‘𝐾) |
| lhpjat.u | ⊢ 1 = (1.‘𝐾) |
| lhpjat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| lhpjat.h | ⊢ 𝐻 = (LHyp‘𝐾) |
| Ref | Expression |
|---|---|
| lhpjat1 | ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑊 ∨ 𝑃) = 1 ) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | simpll 766 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝐾 ∈ HL) | |
| 2 | eqid 2729 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 3 | lhpjat.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 2, 3 | lhpbase 39985 | . . 3 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾)) |
| 5 | 4 | ad2antlr 727 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾)) |
| 6 | simprl 770 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴) | |
| 7 | lhpjat.u | . . . 4 ⊢ 1 = (1.‘𝐾) | |
| 8 | eqid 2729 | . . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
| 9 | 7, 8, 3 | lhp1cvr 39986 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) → 𝑊( ⋖ ‘𝐾) 1 ) |
| 10 | 9 | adantr 480 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊( ⋖ ‘𝐾) 1 ) |
| 11 | simprr 772 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → ¬ 𝑃 ≤ 𝑊) | |
| 12 | lhpjat.l | . . 3 ⊢ ≤ = (le‘𝐾) | |
| 13 | lhpjat.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 14 | lhpjat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 15 | 2, 12, 13, 7, 8, 14 | 1cvrjat 39462 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ (Base‘𝐾) ∧ 𝑃 ∈ 𝐴) ∧ (𝑊( ⋖ ‘𝐾) 1 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑊 ∨ 𝑃) = 1 ) |
| 16 | 1, 5, 6, 10, 11, 15 | syl32anc 1380 | 1 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → (𝑊 ∨ 𝑃) = 1 ) |
| Colors of variables: wff setvar class |
| Syntax hints: ¬ wn 3 → wi 4 ∧ wa 395 = wceq 1540 ∈ wcel 2109 class class class wbr 5102 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 lecple 17203 joincjn 18252 1.cp1 18363 ⋖ ccvr 39248 Atomscatm 39249 HLchlt 39336 LHypclh 39971 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-proset 18235 df-poset 18254 df-plt 18269 df-lub 18285 df-glb 18286 df-join 18287 df-meet 18288 df-p0 18364 df-p1 18365 df-lat 18373 df-clat 18440 df-oposet 39162 df-ol 39164 df-oml 39165 df-covers 39252 df-ats 39253 df-atl 39284 df-cvlat 39308 df-hlat 39337 df-lhyp 39975 |
| This theorem is referenced by: lhpjat2 40008 lhpj1 40009 trljat1 40153 trljat2 40154 cdlemc1 40178 cdlemc6 40183 cdleme20c 40298 cdleme20j 40305 trlcolem 40713 |
| Copyright terms: Public domain | W3C validator |