| Mathbox for Norm Megill |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > pmapmeet | Structured version Visualization version GIF version | ||
| Description: The projective map of a meet. (Contributed by NM, 25-Jan-2012.) |
| Ref | Expression |
|---|---|
| pmapmeet.b | ⊢ 𝐵 = (Base‘𝐾) |
| pmapmeet.m | ⊢ ∧ = (meet‘𝐾) |
| pmapmeet.a | ⊢ 𝐴 = (Atoms‘𝐾) |
| pmapmeet.p | ⊢ 𝑃 = (pmap‘𝐾) |
| Ref | Expression |
|---|---|
| pmapmeet | ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2733 | . . . 4 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 2 | pmapmeet.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 3 | simp1 1136 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ HL) | |
| 4 | simp2 1137 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | simp3 1138 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 6 | 1, 2, 3, 4, 5 | meetval 18305 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) = ((glb‘𝐾)‘{𝑋, 𝑌})) |
| 7 | 6 | fveq2d 6835 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌}))) |
| 8 | prssi 4774 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) | |
| 9 | 8 | 3adant1 1130 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) |
| 10 | prnzg 4732 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → {𝑋, 𝑌} ≠ ∅) | |
| 11 | 10 | 3ad2ant2 1134 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ≠ ∅) |
| 12 | pmapmeet.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 13 | pmapmeet.p | . . . 4 ⊢ 𝑃 = (pmap‘𝐾) | |
| 14 | 12, 1, 13 | pmapglb 39879 | . . 3 ⊢ ((𝐾 ∈ HL ∧ {𝑋, 𝑌} ⊆ 𝐵 ∧ {𝑋, 𝑌} ≠ ∅) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 15 | 3, 9, 11, 14 | syl3anc 1373 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 16 | fveq2 6831 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑃‘𝑥) = (𝑃‘𝑋)) | |
| 17 | fveq2 6831 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑃‘𝑥) = (𝑃‘𝑌)) | |
| 18 | 16, 17 | iinxprg 5041 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 19 | 18 | 3adant1 1130 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 20 | 7, 15, 19 | 3eqtrd 2772 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1541 ∈ wcel 2113 ≠ wne 2930 ∩ cin 3898 ⊆ wss 3899 ∅c0 4284 {cpr 4579 ∩ ciin 4944 ‘cfv 6489 (class class class)co 7355 Basecbs 17130 glbcglb 18226 meetcmee 18228 Atomscatm 39372 HLchlt 39459 pmapcpmap 39606 |
| 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 1911 ax-6 1968 ax-7 2009 ax-8 2115 ax-9 2123 ax-10 2146 ax-11 2162 ax-12 2182 ax-ext 2705 ax-rep 5221 ax-sep 5238 ax-nul 5248 ax-pow 5307 ax-pr 5374 ax-un 7677 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1544 df-fal 1554 df-ex 1781 df-nf 1785 df-sb 2068 df-mo 2537 df-eu 2566 df-clab 2712 df-cleq 2725 df-clel 2808 df-nfc 2883 df-ne 2931 df-ral 3050 df-rex 3059 df-rmo 3348 df-reu 3349 df-rab 3398 df-v 3440 df-sbc 3739 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-nul 4285 df-if 4477 df-pw 4553 df-sn 4578 df-pr 4580 df-op 4584 df-uni 4861 df-iun 4945 df-iin 4946 df-br 5096 df-opab 5158 df-mpt 5177 df-id 5516 df-xp 5627 df-rel 5628 df-cnv 5629 df-co 5630 df-dm 5631 df-rn 5632 df-res 5633 df-ima 5634 df-iota 6445 df-fun 6491 df-fn 6492 df-f 6493 df-f1 6494 df-fo 6495 df-f1o 6496 df-fv 6497 df-riota 7312 df-ov 7358 df-oprab 7359 df-poset 18229 df-lub 18260 df-glb 18261 df-join 18262 df-meet 18263 df-lat 18348 df-clat 18415 df-ats 39376 df-hlat 39460 df-pmap 39613 |
| This theorem is referenced by: hlmod1i 39965 poldmj1N 40037 pmapj2N 40038 pnonsingN 40042 psubclinN 40057 poml4N 40062 pl42lem1N 40088 pl42lem2N 40089 |
| Copyright terms: Public domain | W3C validator |