![]() |
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 39321 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑋 ∨ 𝑄)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
7 | hllat 38830 | . . . . 5 ⊢ (𝐾 ∈ HL → 𝐾 ∈ Lat) | |
8 | 7 | 3ad2ant1 1131 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ Lat) |
9 | 1, 3 | atbase 38756 | . . . . 5 ⊢ (𝑄 ∈ 𝐴 → 𝑄 ∈ 𝐵) |
10 | 9 | 3ad2ant3 1133 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑄 ∈ 𝐵) |
11 | simp2 1135 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝑋 ∈ 𝐵) | |
12 | 1, 2 | latjcom 18433 | . . . 4 ⊢ ((𝐾 ∈ Lat ∧ 𝑄 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
13 | 8, 10, 11, 12 | syl3anc 1369 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑄 ∨ 𝑋) = (𝑋 ∨ 𝑄)) |
14 | 13 | fveq2d 6896 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = (𝑀‘(𝑋 ∨ 𝑄))) |
15 | simp1 1134 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → 𝐾 ∈ HL) | |
16 | 1, 3, 4 | pmapssat 39227 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑄 ∈ 𝐵) → (𝑀‘𝑄) ⊆ 𝐴) |
17 | 15, 10, 16 | syl2anc 583 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑄) ⊆ 𝐴) |
18 | 1, 3, 4 | pmapssat 39227 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵) → (𝑀‘𝑋) ⊆ 𝐴) |
19 | 18 | 3adant3 1130 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘𝑋) ⊆ 𝐴) |
20 | 3, 5 | paddcom 39281 | . . 3 ⊢ ((𝐾 ∈ Lat ∧ (𝑀‘𝑄) ⊆ 𝐴 ∧ (𝑀‘𝑋) ⊆ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
21 | 8, 17, 19, 20 | syl3anc 1369 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → ((𝑀‘𝑄) + (𝑀‘𝑋)) = ((𝑀‘𝑋) + (𝑀‘𝑄))) |
22 | 6, 14, 21 | 3eqtr4d 2778 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑄 ∈ 𝐴) → (𝑀‘(𝑄 ∨ 𝑋)) = ((𝑀‘𝑄) + (𝑀‘𝑋))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ w3a 1085 = wceq 1534 ∈ wcel 2099 ⊆ wss 3945 ‘cfv 6543 (class class class)co 7415 Basecbs 17174 joincjn 18297 Latclat 18417 Atomscatm 38730 HLchlt 38817 pmapcpmap 38965 +𝑃cpadd 39263 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2167 ax-ext 2699 ax-rep 5280 ax-sep 5294 ax-nul 5301 ax-pow 5360 ax-pr 5424 ax-un 7735 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2530 df-eu 2559 df-clab 2706 df-cleq 2720 df-clel 2806 df-nfc 2881 df-ne 2937 df-ral 3058 df-rex 3067 df-rmo 3372 df-reu 3373 df-rab 3429 df-v 3472 df-sbc 3776 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-nul 4320 df-if 4526 df-pw 4601 df-sn 4626 df-pr 4628 df-op 4632 df-uni 4905 df-iun 4994 df-br 5144 df-opab 5206 df-mpt 5227 df-id 5571 df-xp 5679 df-rel 5680 df-cnv 5681 df-co 5682 df-dm 5683 df-rn 5684 df-res 5685 df-ima 5686 df-iota 6495 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7371 df-ov 7418 df-oprab 7419 df-mpo 7420 df-1st 7988 df-2nd 7989 df-proset 18281 df-poset 18299 df-plt 18316 df-lub 18332 df-glb 18333 df-join 18334 df-meet 18335 df-p0 18411 df-lat 18418 df-clat 18485 df-oposet 38643 df-ol 38645 df-oml 38646 df-covers 38733 df-ats 38734 df-atl 38765 df-cvlat 38789 df-hlat 38818 df-pmap 38972 df-padd 39264 |
This theorem is referenced by: atmod1i1 39325 |
Copyright terms: Public domain | W3C validator |