| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > pjf2 | Structured version Visualization version GIF version | ||
| Description: A projection is a function from the base set to the subspace. (Contributed by Mario Carneiro, 16-Oct-2015.) |
| Ref | Expression |
|---|---|
| pjf.k | ⊢ 𝐾 = (proj‘𝑊) |
| pjf.v | ⊢ 𝑉 = (Base‘𝑊) |
| Ref | Expression |
|---|---|
| pjf2 | ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇):𝑉⟶𝑇) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2760 | . . 3 ⊢ (+g‘𝑊) = (+g‘𝑊) | |
| 2 | eqid 2760 | . . 3 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊) | |
| 3 | eqid 2760 | . . 3 ⊢ (0g‘𝑊) = (0g‘𝑊) | |
| 4 | eqid 2760 | . . 3 ⊢ (Cntz‘𝑊) = (Cntz‘𝑊) | |
| 5 | phllmod 21844 | . . . . . 6 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 6 | 5 | adantr 486 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑊 ∈ LMod) |
| 7 | eqid 2760 | . . . . . 6 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊) | |
| 8 | 7 | lsssssubg 21143 | . . . . 5 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 9 | 6, 8 | syl 18 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊)) |
| 10 | pjf.v | . . . . . 6 ⊢ 𝑉 = (Base‘𝑊) | |
| 11 | eqid 2760 | . . . . . 6 ⊢ (ocv‘𝑊) = (ocv‘𝑊) | |
| 12 | pjf.k | . . . . . 6 ⊢ 𝐾 = (proj‘𝑊) | |
| 13 | 10, 7, 11, 2, 12 | pjdm2 21925 | . . . . 5 ⊢ (𝑊 ∈ PreHil → (𝑇 ∈ dom 𝐾 ↔ (𝑇 ∈ (LSubSp‘𝑊) ∧ (𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇)) = 𝑉))) |
| 14 | 13 | simprbda 504 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ∈ (LSubSp‘𝑊)) |
| 15 | 9, 14 | sseldd 3932 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ∈ (SubGrp‘𝑊)) |
| 16 | 10, 7 | lssss 21121 | . . . . . 6 ⊢ (𝑇 ∈ (LSubSp‘𝑊) → 𝑇 ⊆ 𝑉) |
| 17 | 14, 16 | syl 18 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ⊆ 𝑉) |
| 18 | 10, 11, 7 | ocvlss 21886 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ⊆ 𝑉) → ((ocv‘𝑊)‘𝑇) ∈ (LSubSp‘𝑊)) |
| 19 | 17, 18 | syldan 603 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((ocv‘𝑊)‘𝑇) ∈ (LSubSp‘𝑊)) |
| 20 | 9, 19 | sseldd 3932 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((ocv‘𝑊)‘𝑇) ∈ (SubGrp‘𝑊)) |
| 21 | 11, 7, 3 | ocvin 21888 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ (LSubSp‘𝑊)) → (𝑇 ∩ ((ocv‘𝑊)‘𝑇)) = {(0g‘𝑊)}) |
| 22 | 14, 21 | syldan 603 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇 ∩ ((ocv‘𝑊)‘𝑇)) = {(0g‘𝑊)}) |
| 23 | lmodabl 21094 | . . . . 5 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel) | |
| 24 | 6, 23 | syl 18 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑊 ∈ Abel) |
| 25 | 4, 24, 15, 20 | ablcntzd 19985 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ⊆ ((Cntz‘𝑊)‘((ocv‘𝑊)‘𝑇))) |
| 26 | eqid 2760 | . . 3 ⊢ (proj1‘𝑊) = (proj1‘𝑊) | |
| 27 | 1, 2, 3, 4, 15, 20, 22, 25, 26 | pj1f 19825 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(proj1‘𝑊)((ocv‘𝑊)‘𝑇)):(𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇))⟶𝑇) |
| 28 | 11, 26, 12 | pjval 21924 | . . . . 5 ⊢ (𝑇 ∈ dom 𝐾 → (𝐾‘𝑇) = (𝑇(proj1‘𝑊)((ocv‘𝑊)‘𝑇))) |
| 29 | 28 | adantl 487 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇) = (𝑇(proj1‘𝑊)((ocv‘𝑊)‘𝑇))) |
| 30 | 29 | eqcomd 2766 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(proj1‘𝑊)((ocv‘𝑊)‘𝑇)) = (𝐾‘𝑇)) |
| 31 | 13 | simplbda 505 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇)) = 𝑉) |
| 32 | 30, 31 | feq12d 6691 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((𝑇(proj1‘𝑊)((ocv‘𝑊)‘𝑇)):(𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇))⟶𝑇 ↔ (𝐾‘𝑇):𝑉⟶𝑇)) |
| 33 | 27, 32 | mpbid 235 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇):𝑉⟶𝑇) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ∩ cin 3898 ⊆ wss 3899 {csn 4584 dom cdm 5655 ⟶wf 6529 ‘cfv 6533 (class class class)co 7414 Basecbs 17302 +gcplusg 17343 0gc0g 17525 SubGrpcsubg 19244 Cntzccntz 19443 LSSumclsm 19762 proj1cpj1 19763 Abelcabl 19909 LModclmod 21045 LSubSpclss 21116 PreHilcphl 21838 ocvcocv 21874 projcpj 21914 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7737 ax-cnex 11181 ax-resscn 11182 ax-1cn 11183 ax-icn 11184 ax-addcl 11185 ax-addrcl 11186 ax-mulcl 11187 ax-mulrcl 11188 ax-mulcom 11189 ax-addass 11190 ax-mulass 11191 ax-distr 11192 ax-i2m1 11193 ax-1ne0 11194 ax-1rid 11195 ax-rnegex 11196 ax-rrecex 11197 ax-cnre 11198 ax-pre-lttri 11199 ax-pre-lttrn 11200 ax-pre-ltadd 11201 ax-pre-mulgt0 11202 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7371 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7864 df-1st 7987 df-2nd 7988 df-frecs 8281 df-wrecs 8312 df-recs 8361 df-rdg 8400 df-er 8697 df-map 8829 df-en 8954 df-dom 8955 df-sdom 8956 df-pnf 11270 df-mnf 11271 df-xr 11272 df-ltxr 11273 df-le 11274 df-sub 11468 df-neg 11469 df-nn 12259 df-2 12328 df-3 12329 df-4 12330 df-5 12331 df-6 12332 df-7 12333 df-8 12334 df-sets 17257 df-slot 17275 df-ndx 17287 df-base 17303 df-ress 17324 df-plusg 17356 df-sca 17359 df-vsca 17360 df-ip 17361 df-0g 17527 df-mgm 18731 df-sgrp 18822 df-mnd 18838 df-grp 19061 df-minusg 19062 df-sbg 19063 df-subg 19247 df-ghm 19342 df-cntz 19445 df-lsm 19764 df-pj1 19765 df-cmn 19910 df-abl 19911 df-mgp 20275 df-rng 20289 df-ur 20322 df-ring 20375 df-lmod 21047 df-lss 21117 df-lmhm 21207 df-lvec 21288 df-sra 21358 df-rgmod 21359 df-phl 21840 df-ocv 21877 df-pj 21917 |
| This theorem is used by: pjfo 21929 |
| Copyright terms: Public domain | W3C validator |