pjf2 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > pjf2		Structured version Visualization version GIF version

Theorem pjf2 20850

Description: A projection is a function from the base set to the subspace. (Contributed by Mario Carneiro, 16-Oct-2015.)

**Hypotheses**
Ref	Expression
pjf.k	⊢ 𝐾 = (proj‘𝑊)
pjf.v	⊢ 𝑉 = (Base‘𝑊)

**Assertion**
Ref	Expression
pjf2	⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇):𝑉⟶𝑇)

**Proof of Theorem pjf2**
Step	Hyp	Ref	Expression
1		eqid 2819	. . 3 ⊢ (+_g‘𝑊) = (+_g‘𝑊)
2		eqid 2819	. . 3 ⊢ (LSSum‘𝑊) = (LSSum‘𝑊)
3		eqid 2819	. . 3 ⊢ (0_g‘𝑊) = (0_g‘𝑊)
4		eqid 2819	. . 3 ⊢ (Cntz‘𝑊) = (Cntz‘𝑊)
5		phllmod 20766	. . . . . 6 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod)
6	5	adantr 483	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑊 ∈ LMod)
7		eqid 2819	. . . . . 6 ⊢ (LSubSp‘𝑊) = (LSubSp‘𝑊)
8	7	lsssssubg 19722	. . . . 5 ⊢ (𝑊 ∈ LMod → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊))
9	6, 8	syl 17	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (LSubSp‘𝑊) ⊆ (SubGrp‘𝑊))
10		pjf.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
11		eqid 2819	. . . . . 6 ⊢ (ocv‘𝑊) = (ocv‘𝑊)
12		pjf.k	. . . . . 6 ⊢ 𝐾 = (proj‘𝑊)
13	10, 7, 11, 2, 12	pjdm2 20847	. . . . 5 ⊢ (𝑊 ∈ PreHil → (𝑇 ∈ dom 𝐾 ↔ (𝑇 ∈ (LSubSp‘𝑊) ∧ (𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇)) = 𝑉)))
14	13	simprbda 501	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ∈ (LSubSp‘𝑊))
15	9, 14	sseldd 3966	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ∈ (SubGrp‘𝑊))
16	10, 7	lssss 19700	. . . . . 6 ⊢ (𝑇 ∈ (LSubSp‘𝑊) → 𝑇 ⊆ 𝑉)
17	14, 16	syl 17	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ⊆ 𝑉)
18	10, 11, 7	ocvlss 20808	. . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ⊆ 𝑉) → ((ocv‘𝑊)‘𝑇) ∈ (LSubSp‘𝑊))
19	17, 18	syldan 593	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((ocv‘𝑊)‘𝑇) ∈ (LSubSp‘𝑊))
20	9, 19	sseldd 3966	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((ocv‘𝑊)‘𝑇) ∈ (SubGrp‘𝑊))
21	11, 7, 3	ocvin 20810	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ (LSubSp‘𝑊)) → (𝑇 ∩ ((ocv‘𝑊)‘𝑇)) = {(0_g‘𝑊)})
22	14, 21	syldan 593	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇 ∩ ((ocv‘𝑊)‘𝑇)) = {(0_g‘𝑊)})
23		lmodabl 19673	. . . . 5 ⊢ (𝑊 ∈ LMod → 𝑊 ∈ Abel)
24	6, 23	syl 17	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑊 ∈ Abel)
25	4, 24, 15, 20	ablcntzd 18969	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → 𝑇 ⊆ ((Cntz‘𝑊)‘((ocv‘𝑊)‘𝑇)))
26		eqid 2819	. . 3 ⊢ (proj₁‘𝑊) = (proj₁‘𝑊)
27	1, 2, 3, 4, 15, 20, 22, 25, 26	pj1f 18815	. 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(proj₁‘𝑊)((ocv‘𝑊)‘𝑇)):(𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇))⟶𝑇)
28	11, 26, 12	pjval 20846	. . . . 5 ⊢ (𝑇 ∈ dom 𝐾 → (𝐾‘𝑇) = (𝑇(proj₁‘𝑊)((ocv‘𝑊)‘𝑇)))
29	28	adantl 484	. . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇) = (𝑇(proj₁‘𝑊)((ocv‘𝑊)‘𝑇)))
30	29	eqcomd 2825	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(proj₁‘𝑊)((ocv‘𝑊)‘𝑇)) = (𝐾‘𝑇))
31	13	simplbda 502	. . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇)) = 𝑉)
32	30, 31	feq12d 6495	. 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → ((𝑇(proj₁‘𝑊)((ocv‘𝑊)‘𝑇)):(𝑇(LSSum‘𝑊)((ocv‘𝑊)‘𝑇))⟶𝑇 ↔ (𝐾‘𝑇):𝑉⟶𝑇))
33	27, 32	mpbid 234	1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑇 ∈ dom 𝐾) → (𝐾‘𝑇):𝑉⟶𝑇)

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 398 = wceq 1531 ∈ wcel 2108 ∩ cin 3933 ⊆ wss 3934 {csn 4559 dom cdm 5548 ⟶wf 6344 ‘cfv 6348 (class class class)co 7148 Basecbs 16475 +_gcplusg 16557 0_gc0g 16705 SubGrpcsubg 18265 Cntzccntz 18437 LSSumclsm 18751 proj₁cpj1 18752 Abelcabl 18899 LModclmod 19626 LSubSpclss 19695 PreHilcphl 20760 ocvcocv 20796 projcpj 20836

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1905 ax-6 1964 ax-7 2009 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2154 ax-12 2170 ax-ext 2791 ax-rep 5181 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7453 ax-cnex 10585 ax-resscn 10586 ax-1cn 10587 ax-icn 10588 ax-addcl 10589 ax-addrcl 10590 ax-mulcl 10591 ax-mulrcl 10592 ax-mulcom 10593 ax-addass 10594 ax-mulass 10595 ax-distr 10596 ax-i2m1 10597 ax-1ne0 10598 ax-1rid 10599 ax-rnegex 10600 ax-rrecex 10601 ax-cnre 10602 ax-pre-lttri 10603 ax-pre-lttrn 10604 ax-pre-ltadd 10605 ax-pre-mulgt0 10606

This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1534 df-ex 1775 df-nf 1779 df-sb 2064 df-mo 2616 df-eu 2648 df-clab 2798 df-cleq 2812 df-clel 2891 df-nfc 2961 df-ne 3015 df-nel 3122 df-ral 3141 df-rex 3142 df-reu 3143 df-rmo 3144 df-rab 3145 df-v 3495 df-sbc 3771 df-csb 3882 df-dif 3937 df-un 3939 df-in 3941 df-ss 3950 df-pss 3952 df-nul 4290 df-if 4466 df-pw 4539 df-sn 4560 df-pr 4562 df-tp 4564 df-op 4566 df-uni 4831 df-int 4868 df-iun 4912 df-br 5058 df-opab 5120 df-mpt 5138 df-tr 5164 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7106 df-ov 7151 df-oprab 7152 df-mpo 7153 df-om 7573 df-1st 7681 df-2nd 7682 df-wrecs 7939 df-recs 8000 df-rdg 8038 df-er 8281 df-map 8400 df-en 8502 df-dom 8503 df-sdom 8504 df-pnf 10669 df-mnf 10670 df-xr 10671 df-ltxr 10672 df-le 10673 df-sub 10864 df-neg 10865 df-nn 11631 df-2 11692 df-3 11693 df-4 11694 df-5 11695 df-6 11696 df-7 11697 df-8 11698 df-ndx 16478 df-slot 16479 df-base 16481 df-sets 16482 df-ress 16483 df-plusg 16570 df-sca 16573 df-vsca 16574 df-ip 16575 df-0g 16707 df-mgm 17844 df-sgrp 17893 df-mnd 17904 df-grp 18098 df-minusg 18099 df-sbg 18100 df-subg 18268 df-ghm 18348 df-cntz 18439 df-lsm 18753 df-pj1 18754 df-cmn 18900 df-abl 18901 df-mgp 19232 df-ur 19244 df-ring 19291 df-lmod 19628 df-lss 19696 df-lmhm 19786 df-lvec 19867 df-sra 19936 df-rgmod 19937 df-phl 20762 df-ocv 20799 df-pj 20839

This theorem is referenced by: pjfo 20851

W3C validator