| 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 2730 | . . . 4 ⊢ (Base‘𝐾) = (Base‘𝐾) | |
| 3 | lhpjat.h | . . . 4 ⊢ 𝐻 = (LHyp‘𝐾) | |
| 4 | 2, 3 | lhpbase 39999 | . . 3 ⊢ (𝑊 ∈ 𝐻 → 𝑊 ∈ (Base‘𝐾)) |
| 5 | 4 | ad2antlr 727 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑊 ∈ (Base‘𝐾)) |
| 6 | simprl 770 | . 2 ⊢ (((𝐾 ∈ HL ∧ 𝑊 ∈ 𝐻) ∧ (𝑃 ∈ 𝐴 ∧ ¬ 𝑃 ≤ 𝑊)) → 𝑃 ∈ 𝐴) | |
| 7 | lhpjat.u | . . . 4 ⊢ 1 = (1.‘𝐾) | |
| 8 | eqid 2730 | . . . 4 ⊢ ( ⋖ ‘𝐾) = ( ⋖ ‘𝐾) | |
| 9 | 7, 8, 3 | lhp1cvr 40000 | . . 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 39476 | . 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 5110 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 lecple 17234 joincjn 18279 1.cp1 18390 ⋖ ccvr 39262 Atomscatm 39263 HLchlt 39350 LHypclh 39985 |
| 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 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| 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 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-proset 18262 df-poset 18281 df-plt 18296 df-lub 18312 df-glb 18313 df-join 18314 df-meet 18315 df-p0 18391 df-p1 18392 df-lat 18398 df-clat 18465 df-oposet 39176 df-ol 39178 df-oml 39179 df-covers 39266 df-ats 39267 df-atl 39298 df-cvlat 39322 df-hlat 39351 df-lhyp 39989 |
| This theorem is referenced by: lhpjat2 40022 lhpj1 40023 trljat1 40167 trljat2 40168 cdlemc1 40192 cdlemc6 40197 cdleme20c 40312 cdleme20j 40319 trlcolem 40727 |
| Copyright terms: Public domain | W3C validator |