| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapjat2 | Structured version Visualization version GIF version | ||
| Description: The projective map of the join of an atom with a lattice element. (Contributed by NM, 12-May-2012.) |
| Ref | Expression |
|---|---|
| pmapjat.b | ⊢ 𝐵 = (Base‘𝐾) |
| pmapjat.j | ⊢ ∨ = (join‘𝐾) |
| pmapjat.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| pmapjat.m | ⊢ 𝑀 = (pmap‘𝐾) |
| pmapjat.p | ⊢ + = (+𝑃‘𝐾) |
| Ref | Expression |
|---|---|
| pmapjat2 | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | pmapjat.b | . . 3 ⊢ 𝐵 = (Base‘𝐾) | |
| 2 | pmapjat.j | . . 3 ⊢ ∨ = (join‘𝐾) | |
| 3 | pmapjat.a | . . 3 ⊢ 𝐴 = (Atoms‘𝐾) | |
| 4 | pmapjat.m | . . 3 ⊢ 𝑀 = (pmap‘𝐾) | |
| 5 | pmapjat.p | . . 3 ⊢ + = (+𝑃‘𝐾) | |
| 6 | 1, 2, 3, 4, 5 | pmapjat1 40729 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 7 | hllat 40239 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 8 | 7 | 3ad2ant1 1151 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat) |
| 9 | 1, 3 | atbase 40165 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 10 | 9 | 3ad2ant3 1153 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
| 11 | simp2 1155 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 2 | latjcom 18538 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 13 | 8, 10, 11, 12 | syl3anc 1398 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 14 | 13 | fveq2d 6883 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄))) |
| 15 | simp1 1154 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
| 16 | 1, 3, 4 | pmapssat 40635 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴) |
| 17 | 15, 10, 16 | syl2anc 596 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴) |
| 18 | 1, 3, 4 | pmapssat 40635 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴) |
| 19 | 18 | 3adant3 1150 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴) |
| 20 | 3, 5 | paddcom 40689 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 21 | 8, 17, 19, 20 | syl3anc 1398 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 22 | 6, 14, 21 | 3eqtr4d 2805 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1103 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 (class class class)co 7414 Basecbs 17304 joincjn 18402 Latclat 18522 Atomscatm 40139 HLchlt 40226 pmapcpmap 40373 +𝑃cpadd 40671 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-id 5550 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-1st 7987 df-2nd 7988 df-proset 18385 df-poset 18404 df-plt 18419 df-lub 18435 df-glb 18436 df-join 18437 df-meet 18438 df-p0 18514 df-lat 18523 df-clat 18590 df-oposet 40052 df-ol 40054 df-oml 40055 df-covers 40142 df-ats 40143 df-atl 40174 df-cvlat 40198 df-hlat 40227 df-pmap 40380 df-padd 40672 |
| This theorem is used by: atmod1i1 40733 |
| Copyright terms: Public domain | W3C validator |