![]() |
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 3069 | . . . . . . 7 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ ∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥)) | |
2 | equcom 2019 | . . . . . . . . 9 ⊢ (𝑦 = 𝑥 ↔ 𝑥 = 𝑦) | |
3 | 2 | anbi1ci 624 | . . . . . . . 8 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ (𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
4 | 3 | exbii 1848 | . . . . . . 7 ⊢ (∃𝑥(𝑥 ∈ 𝑆 ∧ 𝑦 = 𝑥) ↔ ∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆)) |
5 | eleq1w 2814 | . . . . . . . 8 ⊢ (𝑥 = 𝑦 → (𝑥 ∈ 𝑆 ↔ 𝑦 ∈ 𝑆)) | |
6 | 5 | equsexvw 2006 | . . . . . . 7 ⊢ (∃𝑥(𝑥 = 𝑦 ∧ 𝑥 ∈ 𝑆) ↔ 𝑦 ∈ 𝑆) |
7 | 1, 4, 6 | 3bitri 296 | . . . . . 6 ⊢ (∃𝑥 ∈ 𝑆 𝑦 = 𝑥 ↔ 𝑦 ∈ 𝑆) |
8 | 7 | abbii 2800 | . . . . 5 ⊢ {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} = {𝑦 ∣ 𝑦 ∈ 𝑆} |
9 | abid2 2869 | . . . . 5 ⊢ {𝑦 ∣ 𝑦 ∈ 𝑆} = 𝑆 | |
10 | 8, 9 | eqtr2i 2759 | . . . 4 ⊢ 𝑆 = {𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥} |
11 | 10 | fveq2i 6893 | . . 3 ⊢ (𝐺‘𝑆) = (𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥}) |
12 | 11 | fveq2i 6893 | . 2 ⊢ (𝑀‘(𝐺‘𝑆)) = (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) |
13 | dfss3 3969 | . . 3 ⊢ (𝑆 ⊆ 𝐵 ↔ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵) | |
14 | pmapglb.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
15 | pmapglb.g | . . . 4 ⊢ 𝐺 = (glb‘𝐾) | |
16 | pmapglb.m | . . . 4 ⊢ 𝑀 = (pmap‘𝐾) | |
17 | 14, 15, 16 | pmapglbx 38943 | . . 3 ⊢ ((𝐾 ∈ HL ∧ ∀𝑥 ∈ 𝑆 𝑥 ∈ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
18 | 13, 17 | syl3an2b 1402 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘{𝑦 ∣ ∃𝑥 ∈ 𝑆 𝑦 = 𝑥})) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
19 | 12, 18 | eqtrid 2782 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑆 ⊆ 𝐵 ∧ 𝑆 ≠ ∅) → (𝑀‘(𝐺‘𝑆)) = ∩ 𝑥 ∈ 𝑆 (𝑀‘𝑥)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ∧ wa 394 ∧ w3a 1085 = wceq 1539 ∃wex 1779 ∈ wcel 2104 {cab 2707 ≠ wne 2938 ∀wral 3059 ∃wrex 3068 ⊆ wss 3947 ∅c0 4321 ∩ ciin 4997 ‘cfv 6542 Basecbs 17148 glbcglb 18267 HLchlt 38523 pmapcpmap 38671 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1911 ax-6 1969 ax-7 2009 ax-8 2106 ax-9 2114 ax-10 2135 ax-11 2152 ax-12 2169 ax-ext 2701 ax-rep 5284 ax-sep 5298 ax-nul 5305 ax-pow 5362 ax-pr 5426 ax-un 7727 |
This theorem depends on definitions: df-bi 206 df-an 395 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2532 df-eu 2561 df-clab 2708 df-cleq 2722 df-clel 2808 df-nfc 2883 df-ne 2939 df-ral 3060 df-rex 3069 df-rmo 3374 df-reu 3375 df-rab 3431 df-v 3474 df-sbc 3777 df-csb 3893 df-dif 3950 df-un 3952 df-in 3954 df-ss 3964 df-nul 4322 df-if 4528 df-pw 4603 df-sn 4628 df-pr 4630 df-op 4634 df-uni 4908 df-iun 4998 df-iin 4999 df-br 5148 df-opab 5210 df-mpt 5231 df-id 5573 df-xp 5681 df-rel 5682 df-cnv 5683 df-co 5684 df-dm 5685 df-rn 5686 df-res 5687 df-ima 5688 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7367 df-ov 7414 df-oprab 7415 df-poset 18270 df-lub 18303 df-glb 18304 df-join 18305 df-meet 18306 df-lat 18389 df-clat 18456 df-ats 38440 df-hlat 38524 df-pmap 38678 |
This theorem is referenced by: pmapglb2N 38945 pmapmeet 38947 |
Copyright terms: Public domain | W3C validator |