| 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 2729 | . . . 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 18330 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑋 ∧ 𝑌) = ((glb‘𝐾)‘{𝑋, 𝑌})) |
| 7 | 6 | fveq2d 6844 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌}))) |
| 8 | prssi 4781 | . . . 4 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) | |
| 9 | 8 | 3adant1 1130 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ⊆ 𝐵) |
| 10 | prnzg 4738 | . . . 4 ⊢ (𝑋 ∈ 𝐵 → {𝑋, 𝑌} ≠ ∅) | |
| 11 | 10 | 3ad2ant2 1134 | . . 3 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → {𝑋, 𝑌} ≠ ∅) |
| 12 | pmapmeet.b | . . . 4 ⊢ 𝐵 = (Base‘𝐾) | |
| 13 | pmapmeet.p | . . . 4 ⊢ 𝑃 = (pmap‘𝐾) | |
| 14 | 12, 1, 13 | pmapglb 39757 | . . 3 ⊢ ((𝐾 ∈ HL ∧ {𝑋, 𝑌} ⊆ 𝐵 ∧ {𝑋, 𝑌} ≠ ∅) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 15 | 3, 9, 11, 14 | syl3anc 1373 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘((glb‘𝐾)‘{𝑋, 𝑌})) = ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥)) |
| 16 | fveq2 6840 | . . . 4 ⊢ (𝑥 = 𝑋 → (𝑃‘𝑥) = (𝑃‘𝑋)) | |
| 17 | fveq2 6840 | . . . 4 ⊢ (𝑥 = 𝑌 → (𝑃‘𝑥) = (𝑃‘𝑌)) | |
| 18 | 16, 17 | iinxprg 5048 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 19 | 18 | 3adant1 1130 | . 2 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → ∩ 𝑥 ∈ {𝑋, 𝑌} (𝑃‘𝑥) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| 20 | 7, 15, 19 | 3eqtrd 2768 | 1 ⊢ ((𝐾 ∈ HL ∧ 𝑋 ∈ 𝐵 ∧ 𝑌 ∈ 𝐵) → (𝑃‘(𝑋 ∧ 𝑌)) = ((𝑃‘𝑋) ∩ (𝑃‘𝑌))) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ∧ w3a 1086 = wceq 1540 ∈ wcel 2109 ≠ wne 2925 ∩ cin 3910 ⊆ wss 3911 ∅c0 4292 {cpr 4587 ∩ ciin 4952 ‘cfv 6499 (class class class)co 7369 Basecbs 17155 glbcglb 18251 meetcmee 18253 Atomscatm 39249 HLchlt 39336 pmapcpmap 39484 |
| 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 2701 ax-rep 5229 ax-sep 5246 ax-nul 5256 ax-pow 5315 ax-pr 5382 ax-un 7691 |
| 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 2533 df-eu 2562 df-clab 2708 df-cleq 2721 df-clel 2803 df-nfc 2878 df-ne 2926 df-ral 3045 df-rex 3054 df-rmo 3351 df-reu 3352 df-rab 3403 df-v 3446 df-sbc 3751 df-csb 3860 df-dif 3914 df-un 3916 df-in 3918 df-ss 3928 df-nul 4293 df-if 4485 df-pw 4561 df-sn 4586 df-pr 4588 df-op 4592 df-uni 4868 df-iun 4953 df-iin 4954 df-br 5103 df-opab 5165 df-mpt 5184 df-id 5526 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6452 df-fun 6501 df-fn 6502 df-f 6503 df-f1 6504 df-fo 6505 df-f1o 6506 df-fv 6507 df-riota 7326 df-ov 7372 df-oprab 7373 df-poset 18254 df-lub 18285 df-glb 18286 df-join 18287 df-meet 18288 df-lat 18373 df-clat 18440 df-ats 39253 df-hlat 39337 df-pmap 39491 |
| This theorem is referenced by: hlmod1i 39843 poldmj1N 39915 pmapj2N 39916 pnonsingN 39920 psubclinN 39935 poml4N 39940 pl42lem1N 39966 pl42lem2N 39967 |
| Copyright terms: Public domain | W3C validator |