| 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 39793 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 7 | hllat 39302 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
| 8 | 7 | 3ad2ant1 1133 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat) |
| 9 | 1, 3 | atbase 39228 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
| 10 | 9 | 3ad2ant3 1135 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
| 11 | simp2 1137 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
| 12 | 1, 2 | latjcom 18442 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 13 | 8, 10, 11, 12 | syl3anc 1372 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
| 14 | 13 | fveq2d 6876 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄))) |
| 15 | simp1 1136 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
| 16 | 1, 3, 4 | pmapssat 39699 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴) |
| 17 | 15, 10, 16 | syl2anc 584 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴) |
| 18 | 1, 3, 4 | pmapssat 39699 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴) |
| 19 | 18 | 3adant3 1132 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴) |
| 20 | 3, 5 | paddcom 39753 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 21 | 8, 17, 19, 20 | syl3anc 1372 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
| 22 | 6, 14, 21 | 3eqtr4d 2779 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1539 ∈ wcel 2107 ⊆ wss 3924 ‘cfv 6527 (class class class)co 7399 Basecbs 17213 joincjn 18308 Latclat 18426 Atomscatm 39202 HLchlt 39289 pmapcpmap 39437 +𝑃cpadd 39735 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1794 ax-4 1808 ax-5 1909 ax-6 1966 ax-7 2006 ax-8 2109 ax-9 2117 ax-10 2140 ax-11 2156 ax-12 2176 ax-ext 2706 ax-rep 5246 ax-sep 5263 ax-nul 5273 ax-pow 5332 ax-pr 5399 ax-un 7723 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1542 df-fal 1552 df-ex 1779 df-nf 1783 df-sb 2064 df-mo 2538 df-eu 2567 df-clab 2713 df-cleq 2726 df-clel 2808 df-nfc 2884 df-ne 2932 df-ral 3051 df-rex 3060 df-rmo 3357 df-reu 3358 df-rab 3414 df-v 3459 df-sbc 3764 df-csb 3873 df-dif 3927 df-un 3929 df-in 3931 df-ss 3941 df-nul 4307 df-if 4499 df-pw 4575 df-sn 4600 df-pr 4602 df-op 4606 df-uni 4881 df-iun 4966 df-br 5117 df-opab 5179 df-mpt 5199 df-id 5545 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-iota 6480 df-fun 6529 df-fn 6530 df-f 6531 df-f1 6532 df-fo 6533 df-f1o 6534 df-fv 6535 df-riota 7356 df-ov 7402 df-oprab 7403 df-mpo 7404 df-1st 7982 df-2nd 7983 df-proset 18291 df-poset 18310 df-plt 18325 df-lub 18341 df-glb 18342 df-join 18343 df-meet 18344 df-p0 18420 df-lat 18427 df-clat 18494 df-oposet 39115 df-ol 39117 df-oml 39118 df-covers 39205 df-ats 39206 df-atl 39237 df-cvlat 39261 df-hlat 39290 df-pmap 39444 df-padd 39736 |
| This theorem is referenced by: atmod1i1 39797 |
| Copyright terms: Public domain | W3C validator |