| 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 2766 | . . . 4 ⊢ (glb‘𝐾) = (glb‘𝐾) | |
| 2 | pmapmeet.m | . . . 4 ⊢ ∧ = (meet‘𝐾) | |
| 3 | simp1 1155 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝐾 ∈ HL) | |
| 4 | simp2 1156 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑋 ∈ 𝐵) | |
| 5 | simp3 1157 | . . . 4 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → 𝑌 ∈ 𝐵) | |
| 6 | 1, 2, 3, 4, 5 | meetval 18615 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) = ((glb‘𝐾)‘{𝑋, 𝑌})) |
| 7 | 6 | fveq2d 6919 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌}))) |
| 8 | prssi 4781 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) | |
| 9 | 8 | 3adant1 1149 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) |
| 10 | prnzg 4740 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → {𝑋, 𝑌} ≠ ∅) | |
| 11 | 10 | 3ad2ant2 1153 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ≠ ∅) |
| 12 | pmapmeet.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 13 | pmapmeet.p | . . . 4 ⊢ 𝑃 = (pmap‘𝐾) | |
| 14 | 12, 1, 13 | pmapglb 41095 | . . 3 ⊢ ((𝐾 ∈ HL ∧ {𝑋, 𝑌} ⊆ 𝐵 ∧ {𝑋, 𝑌} ≠ ∅) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 15 | 3, 9, 11, 14 | syl3anc 1401 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 16 | fveq2 6915 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑃‘𝑥) = (𝑃‘𝑋)) | |
| 17 | fveq2 6915 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑃‘𝑥) = (𝑃‘𝑌)) | |
| 18 | 16, 17 | iinxprg 5053 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 19 | 18 | 3adant1 1149 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 20 | 7, 15, 19 | 3eqtrd 2805 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ w3a 1104 = wceq 1572 ∈ wcel 2150 ≠ wne 2962 ⊆ wss 3899 ∩ cin 4091 ∅c0 4280 {cpr 4589 ∩ ciin 4956 ‘cfv 6565 (class class class)co 7450 Basecbs 17433 glbcglb 18536 meetcmee 18538 Atomscatm 40588 HLchlt 40675 pmapcpmap 40822 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1830 ax-4 1844 ax-5 1947 ax-6 2004 ax-7 2045 ax-8 2152 ax-9 2160 ax-10 2183 ax-11 2200 ax-12 2219 ax-ext 2738 ax-rep 5237 ax-sep 5254 ax-nul 5265 ax-pow 5333 ax-pr 5397 ax-un 7782 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3an 1106 df-tru 1575 df-fal 1585 df-ex 1815 df-nf 1819 df-sb 2104 df-mo 2570 df-eu 2600 df-clab 2745 df-cleq 2758 df-clel 2842 df-nfc 2916 df-ne 2963 df-ral 3084 df-rex 3094 df-rmo 3368 df-reu 3369 df-rab 3416 df-v 3455 df-sbc 3742 df-csb 3851 df-ss 3900 df-dif 4049 df-in 4093 df-un 4153 df-nul 4281 df-if 4485 df-pw 4561 df-sn 4588 df-pr 4590 df-op 4840 df-uni 4872 df-iun 4957 df-iin 4958 df-br 5108 df-opab 5173 df-mpt 5192 df-id 5552 df-xp 5663 df-rel 5664 df-cnv 5665 df-co 5666 df-dm 5667 df-rn 5668 df-res 5669 df-ima 5670 df-iota 6519 df-fun 6567 df-fn 6568 df-f 6569 df-f1 6570 df-fo 6571 df-f1o 6572 df-fv 6573 df-riota 7407 df-ov 7453 df-oprab 7454 df-poset 18539 df-lub 18570 df-glb 18571 df-join 18572 df-meet 18573 df-lat 18658 df-clat 18725 df-ats 40592 df-hlat 40676 df-pmap 40829 |
| This theorem is used by: hlmod1i 41181 poldmj1N 41253 pmapj2N 41254 pnonsingN 41258 psubclinN 41273 poml4N 41278 pl42lem1N 41304 pl42lem2N 41305 |
| Copyright terms: Public domain | W3C validator |