| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapglb | Structured version Visualization version GIF version | ||
| Description: The projective map of the GLB of a set of lattice elements 𝑆. Variant of Theorem 15.5.2 of [MaedaMaeda] p. 62. (Contributed by NM, 5-Dec-2011.) |
| Ref | Expression |
|---|---|
| pmapglb.b | ⊢ 𝐵 = (Base‘𝐾) |
| pmapglb.g | ⊢ 𝐺 = (glb‘𝐾) |
| pmapglb.m | ⊢ 𝑀 = (pmap‘𝐾) |
| Ref | Expression |
|---|---|
| pmapglb | ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | df-rex 3096 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥)) | |
| 2 | equcom 2045 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
| 3 | 2 | anbi1ci 637 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ (𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
| 4 | 3 | exbii 1875 | . . . . . . 7 ⊢ (∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
| 5 | eleq1w 2852 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆)) | |
| 6 | 5 | equsexvw 2032 | . . . . . . 7 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆) ↔ 𝑦 ∈ 𝑆) |
| 7 | 1, 4, 6 | 3bitri 300 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ 𝑦 ∈ 𝑆) |
| 8 | 7 | abbii 2836 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} = {𝑦 ∣ 𝑦 ∈ 𝑆} |
| 9 | abid2 2906 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 ∈ 𝑆} = 𝑆 | |
| 10 | 8, 9 | eqtr2i 2793 | . . . 4 ⊢ 𝑆 = {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} |
| 11 | 10 | fveq2i 6885 | . . 3 ⊢ (𝐺‘𝑆) = (𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥}) |
| 12 | 11 | fveq2i 6885 | . 2 ⊢ (𝑀‘(𝐺‘𝑆)) = (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) |
| 13 | dfss3 3934 | . . 3 ⊢ (𝑆 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵) | |
| 14 | pmapglb.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 15 | pmapglb.g | . . . 4 ⊢ 𝐺 = (glb‘𝐾) | |
| 16 | pmapglb.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
| 17 | 14, 15, 16 | pmapglbx 40432 | . . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
| 18 | 13, 17 | syl3an2b 1429 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
| 19 | 12, 18 | eqtrid 2816 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ wa 400 ∧ w3a 1101 = wceq 1567 ∃wex 1806 ∈ wcel 2149 {cab 2747 ≠ wne 2964 ∀wral 3085 ∃wrex 3095 ⊆ wss 3913 ∅c0 4294 ∩ ciin 4961 ‘cfv 6537 Basecbs 17268 glbcglb 18365 HLchlt 40013 pmapcpmap 40160 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1822 ax-4 1836 ax-5 1937 ax-6 1994 ax-7 2035 ax-8 2151 ax-9 2159 ax-10 2182 ax-11 2198 ax-12 2219 ax-ext 2741 ax-rep 5242 ax-sep 5261 ax-nul 5271 ax-pow 5337 ax-pr 5405 ax-un 7733 |
| This theorem depends on definitions: df-bi 210 df-an 401 df-or 861 df-3an 1103 df-tru 1570 df-fal 1580 df-ex 1807 df-nf 1811 df-sb 2098 df-mo 2573 df-eu 2603 df-clab 2748 df-cleq 2761 df-clel 2844 df-nfc 2918 df-ne 2965 df-ral 3086 df-rex 3096 df-rmo 3376 df-reu 3377 df-rab 3424 df-v 3465 df-sbc 3754 df-csb 3862 df-dif 3916 df-un 3918 df-in 3920 df-ss 3930 df-nul 4295 df-if 4493 df-pw 4569 df-sn 4595 df-pr 4597 df-op 4601 df-uni 4877 df-iun 4962 df-iin 4963 df-br 5114 df-opab 5178 df-mpt 5197 df-id 5557 df-xp 5668 df-rel 5669 df-cnv 5670 df-co 5671 df-dm 5672 df-rn 5673 df-res 5674 df-ima 5675 df-iota 6493 df-fun 6539 df-fn 6540 df-f 6541 df-f1 6542 df-fo 6543 df-f1o 6544 df-fv 6545 df-riota 7368 df-ov 7414 df-oprab 7415 df-poset 18368 df-lub 18399 df-glb 18400 df-join 18401 df-meet 18402 df-lat 18487 df-clat 18554 df-ats 39930 df-hlat 40014 df-pmap 40167 |
| This theorem is referenced by: pmapglb2N 40434 pmapmeet 40436 |
| Copyright terms: Public domain | W3C validator |