| 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 40478 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 7 | hllat 39988 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 8 | 7 | 3ad2ant1 1147 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat) |
| 9 | 1, 3 | atbase 39914 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 10 | 9 | 3ad2ant3 1149 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
| 11 | simp2 1151 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 2 | latjcom 18480 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 13 | 8, 10, 11, 12 | syl3anc 1391 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 14 | 13 | fveq2d 6872 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄))) |
| 15 | simp1 1150 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
| 16 | 1, 3, 4 | pmapssat 40384 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴) |
| 17 | 15, 10, 16 | syl2anc 593 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴) |
| 18 | 1, 3, 4 | pmapssat 40384 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴) |
| 19 | 18 | 3adant3 1146 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴) |
| 20 | 3, 5 | paddcom 40438 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 21 | 8, 17, 19, 20 | syl3anc 1391 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 22 | 6, 14, 21 | 3eqtr4d 2808 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1099 = wceq 1561 ∈ wcel 2143 ⊆ wss 3905 ‘cfv 6522 (class class class)co 7397 Basecbs 17246 joincjn 18344 Latclat 18464 Atomscatm 39888 HLchlt 39975 pmapcpmap 40122 +𝑃cpadd 40420 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1816 ax-4 1830 ax-5 1931 ax-6 1988 ax-7 2029 ax-8 2145 ax-9 2153 ax-10 2176 ax-11 2192 ax-12 2213 ax-ext 2735 ax-rep 5228 ax-sep 5247 ax-nul 5257 ax-pow 5323 ax-pr 5391 ax-un 7719 |
| This theorem depends on definitions: df-bi 209 df-an 400 df-or 859 df-3an 1101 df-tru 1564 df-fal 1574 df-ex 1801 df-nf 1805 df-sb 2092 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2838 df-nfc 2912 df-ne 2959 df-ral 3078 df-rex 3088 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3457 df-sbc 3746 df-csb 3854 df-dif 3908 df-un 3910 df-in 3912 df-ss 3922 df-nul 4287 df-if 4482 df-pw 4558 df-sn 4584 df-pr 4586 df-op 4590 df-uni 4867 df-iun 4952 df-br 5102 df-opab 5164 df-mpt 5183 df-id 5543 df-xp 5654 df-rel 5655 df-cnv 5656 df-co 5657 df-dm 5658 df-rn 5659 df-res 5660 df-ima 5661 df-iota 6478 df-fun 6524 df-fn 6525 df-f 6526 df-f1 6527 df-fo 6528 df-f1o 6529 df-fv 6530 df-riota 7354 df-ov 7400 df-oprab 7401 df-mpo 7402 df-1st 7971 df-2nd 7972 df-proset 18327 df-poset 18346 df-plt 18361 df-lub 18377 df-glb 18378 df-join 18379 df-meet 18380 df-p0 18456 df-lat 18465 df-clat 18532 df-oposet 39801 df-ol 39803 df-oml 39804 df-covers 39891 df-ats 39892 df-atl 39923 df-cvlat 39947 df-hlat 39976 df-pmap 40129 df-padd 40421 |
| This theorem is referenced by: atmod1i1 40482 |
| Copyright terms: Public domain | W3C validator |