| 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 2730 | . . . 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 18357 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) = ((glb‘𝐾)‘{𝑋, 𝑌})) |
| 7 | 6 | fveq2d 6865 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌}))) |
| 8 | prssi 4788 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) | |
| 9 | 8 | 3adant1 1130 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) |
| 10 | prnzg 4745 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → {𝑋, 𝑌} ≠ ∅) | |
| 11 | 10 | 3ad2ant2 1134 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ≠ ∅) |
| 12 | pmapmeet.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 13 | pmapmeet.p | . . . 4 ⊢ 𝑃 = (pmap‘𝐾) | |
| 14 | 12, 1, 13 | pmapglb 39771 | . . 3 ⊢ ((𝐾 ∈ HL ∧ {𝑋, 𝑌} ⊆ 𝐵 ∧ {𝑋, 𝑌} ≠ ∅) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 15 | 3, 9, 11, 14 | syl3anc 1373 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 16 | fveq2 6861 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑃‘𝑥) = (𝑃‘𝑋)) | |
| 17 | fveq2 6861 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑃‘𝑥) = (𝑃‘𝑌)) | |
| 18 | 16, 17 | iinxprg 5056 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 19 | 18 | 3adant1 1130 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 20 | 7, 15, 19 | 3eqtrd 2769 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2926 ∩ cin 3916 ⊆ wss 3917 ∅c0 4299 {cpr 4594 ∩ ciin 4959 ‘cfv 6514 (class class class)co 7390 Basecbs 17186 glbcglb 18278 meetcmee 18280 Atomscatm 39263 HLchlt 39350 pmapcpmap 39498 |
| 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 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-iin 4961 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-poset 18281 df-lub 18312 df-glb 18313 df-join 18314 df-meet 18315 df-lat 18398 df-clat 18465 df-ats 39267 df-hlat 39351 df-pmap 39505 |
| This theorem is referenced by: hlmod1i 39857 poldmj1N 39929 pmapj2N 39930 pnonsingN 39934 psubclinN 39949 poml4N 39954 pl42lem1N 39980 pl42lem2N 39981 |
| Copyright terms: Public domain | W3C validator |