| 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 40354 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 7 | hllat 39864 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 8 | 7 | 3ad2ant1 1139 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat) |
| 9 | 1, 3 | atbase 39790 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 10 | 9 | 3ad2ant3 1141 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
| 11 | simp2 1143 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 2 | latjcom 18405 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 13 | 8, 10, 11, 12 | syl3anc 1379 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 14 | 13 | fveq2d 6832 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄))) |
| 15 | simp1 1142 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
| 16 | 1, 3, 4 | pmapssat 40260 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴) |
| 17 | 15, 10, 16 | syl2anc 590 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴) |
| 18 | 1, 3, 4 | pmapssat 40260 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴) |
| 19 | 18 | 3adant3 1138 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴) |
| 20 | 3, 5 | paddcom 40314 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 21 | 8, 17, 19, 20 | syl3anc 1379 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 22 | 6, 14, 21 | 3eqtr4d 2784 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1092 = wceq 1547 ∈ wcel 2119 ⊆ wss 3883 ‘cfv 6486 (class class class)co 7357 Basecbs 17171 joincjn 18269 Latclat 18389 Atomscatm 39764 HLchlt 39851 pmapcpmap 39998 +𝑃cpadd 40296 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1974 ax-7 2015 ax-8 2121 ax-9 2129 ax-10 2152 ax-11 2168 ax-12 2189 ax-ext 2711 ax-rep 5200 ax-sep 5219 ax-nul 5229 ax-pow 5295 ax-pr 5363 ax-un 7679 |
| This theorem depends on definitions: df-bi 208 df-an 397 df-or 854 df-3an 1094 df-tru 1550 df-fal 1560 df-ex 1787 df-nf 1791 df-sb 2074 df-mo 2543 df-eu 2573 df-clab 2718 df-cleq 2731 df-clel 2814 df-nfc 2888 df-ne 2935 df-ral 3054 df-rex 3064 df-rmo 3344 df-reu 3345 df-rab 3392 df-v 3433 df-sbc 3724 df-csb 3832 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4263 df-if 4456 df-pw 4532 df-sn 4557 df-pr 4559 df-op 4563 df-uni 4840 df-iun 4924 df-br 5074 df-opab 5136 df-mpt 5155 df-id 5514 df-xp 5625 df-rel 5626 df-cnv 5627 df-co 5628 df-dm 5629 df-rn 5630 df-res 5631 df-ima 5632 df-iota 6442 df-fun 6488 df-fn 6489 df-f 6490 df-f1 6491 df-fo 6492 df-f1o 6493 df-fv 6494 df-riota 7314 df-ov 7360 df-oprab 7361 df-mpo 7362 df-1st 7932 df-2nd 7933 df-proset 18252 df-poset 18271 df-plt 18286 df-lub 18302 df-glb 18303 df-join 18304 df-meet 18305 df-p0 18381 df-lat 18390 df-clat 18457 df-oposet 39677 df-ol 39679 df-oml 39680 df-covers 39767 df-ats 39768 df-atl 39799 df-cvlat 39823 df-hlat 39852 df-pmap 40005 df-padd 40297 |
| This theorem is referenced by: atmod1i1 40358 |
| Copyright terms: Public domain | W3C validator |