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 3072 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥)) | |
2 | equcom 2020 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
3 | 2 | anbi1ci 626 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ (𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
4 | 3 | exbii 1849 | . . . . . . 7 ⊢ (∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
5 | eleq1w 2820 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆)) | |
6 | 5 | equsexvw 2007 | . . . . . . 7 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆) ↔ 𝑦 ∈ 𝑆) |
7 | 1, 4, 6 | 3bitri 296 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ 𝑦 ∈ 𝑆) |
8 | 7 | abbii 2807 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} = {𝑦 ∣ 𝑦 ∈ 𝑆} |
9 | abid2 2880 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 ∈ 𝑆} = 𝑆 | |
10 | 8, 9 | eqtr2i 2766 | . . . 4 ⊢ 𝑆 = {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} |
11 | 10 | fveq2i 6815 | . . 3 ⊢ (𝐺‘𝑆) = (𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥}) |
12 | 11 | fveq2i 6815 | . 2 ⊢ (𝑀‘(𝐺‘𝑆)) = (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) |
13 | dfss3 3919 | . . 3 ⊢ (𝑆 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵) | |
14 | pmapglb.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
15 | pmapglb.g | . . . 4 ⊢ 𝐺 = (glb‘𝐾) | |
16 | pmapglb.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
17 | 14, 15, 16 | pmapglbx 38004 | . . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
18 | 13, 17 | syl3an2b 1403 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
19 | 12, 18 | eqtrid 2789 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 396 ∧ w3a 1086 = wceq 1540 ∃wex 1780 ∈ wcel 2105 {cab 2714 ≠ wne 2941 ∀wral 3062 ∃wrex 3071 ⊆ wss 3897 ∅c0 4267 ∩ ciin 4938 ‘cfv 6466 Basecbs 16989 glbcglb 18105 HLchlt 37584 pmapcpmap 37732 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1796 ax-4 1810 ax-5 1912 ax-6 1970 ax-7 2010 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2153 ax-12 2170 ax-ext 2708 ax-rep 5224 ax-sep 5238 ax-nul 5245 ax-pow 5303 ax-pr 5367 ax-un 7630 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1781 df-nf 1785 df-sb 2067 df-mo 2539 df-eu 2568 df-clab 2715 df-cleq 2729 df-clel 2815 df-nfc 2887 df-ne 2942 df-ral 3063 df-rex 3072 df-reu 3351 df-rab 3405 df-v 3443 df-sbc 3727 df-csb 3843 df-dif 3900 df-un 3902 df-in 3904 df-ss 3914 df-nul 4268 df-if 4472 df-pw 4547 df-sn 4572 df-pr 4574 df-op 4578 df-uni 4851 df-iun 4939 df-iin 4940 df-br 5088 df-opab 5150 df-mpt 5171 df-id 5507 df-xp 5614 df-rel 5615 df-cnv 5616 df-co 5617 df-dm 5618 df-rn 5619 df-res 5620 df-ima 5621 df-iota 6418 df-fun 6468 df-fn 6469 df-f 6470 df-f1 6471 df-fo 6472 df-f1o 6473 df-fv 6474 df-riota 7274 df-ov 7320 df-oprab 7321 df-poset 18108 df-lub 18141 df-glb 18142 df-join 18143 df-meet 18144 df-lat 18227 df-clat 18294 df-ats 37501 df-hlat 37585 df-pmap 37739 |
This theorem is referenced by: pmapglb2N 38006 pmapmeet 38008 |
Copyright terms: Public domain | W3C validator |