sspg - Metamath Proof Explorer

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

Theorem sspg 30747

Description: Vector addition on a subspace is a restriction of vector addition on the parent space. (Contributed by NM, 28-Jan-2008.) (New usage is discouraged.)

**Hypotheses**
Ref	Expression
sspg.y	⊢ 𝑌 = (BaseSet‘𝑊)
sspg.g	⊢ 𝐺 = ( +_𝑣 ‘𝑈)
sspg.f	⊢ 𝐹 = ( +_𝑣 ‘𝑊)
sspg.h	⊢ 𝐻 = (SubSp‘𝑈)

**Assertion**
Ref	Expression
sspg	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))

Proof of Theorem sspg Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2737	. . . . . . . . . . 11 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		sspg.g	. . . . . . . . . . 11 ⊢ 𝐺 = ( +_𝑣 ‘𝑈)
3	1, 2	nvgf 30637	. . . . . . . . . 10 ⊢ (𝑈 ∈ NrmCVec → 𝐺:((BaseSet‘𝑈) × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4	3	ffund 6740	. . . . . . . . 9 ⊢ (𝑈 ∈ NrmCVec → Fun 𝐺)
5	4	funresd 6609	. . . . . . . 8 ⊢ (𝑈 ∈ NrmCVec → Fun (𝐺 ↾ (𝑌 × 𝑌)))
6	5	adantr 480	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → Fun (𝐺 ↾ (𝑌 × 𝑌)))
7		sspg.h	. . . . . . . . . 10 ⊢ 𝐻 = (SubSp‘𝑈)
8	7	sspnv 30745	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑊 ∈ NrmCVec)
9		sspg.y	. . . . . . . . . 10 ⊢ 𝑌 = (BaseSet‘𝑊)
10		sspg.f	. . . . . . . . . 10 ⊢ 𝐹 = ( +_𝑣 ‘𝑊)
11	9, 10	nvgf 30637	. . . . . . . . 9 ⊢ (𝑊 ∈ NrmCVec → 𝐹:(𝑌 × 𝑌)⟶𝑌)
12	8, 11	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹:(𝑌 × 𝑌)⟶𝑌)
13	12	ffnd 6737	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹 Fn (𝑌 × 𝑌))
14		fnresdm 6687	. . . . . . . . 9 ⊢ (𝐹 Fn (𝑌 × 𝑌) → (𝐹 ↾ (𝑌 × 𝑌)) = 𝐹)
15	13, 14	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝐹 ↾ (𝑌 × 𝑌)) = 𝐹)
16		eqid 2737	. . . . . . . . . . . 12 ⊢ ( ·_𝑠OLD ‘𝑈) = ( ·_𝑠OLD ‘𝑈)
17		eqid 2737	. . . . . . . . . . . 12 ⊢ ( ·_𝑠OLD ‘𝑊) = ( ·_𝑠OLD ‘𝑊)
18		eqid 2737	. . . . . . . . . . . 12 ⊢ (norm_CV‘𝑈) = (norm_CV‘𝑈)
19		eqid 2737	. . . . . . . . . . . 12 ⊢ (norm_CV‘𝑊) = (norm_CV‘𝑊)
20	2, 10, 16, 17, 18, 19, 7	isssp 30743	. . . . . . . . . . 11 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ ( ·_𝑠OLD ‘𝑊) ⊆ ( ·_𝑠OLD ‘𝑈) ∧ (norm_CV‘𝑊) ⊆ (norm_CV‘𝑈)))))
21	20	simplbda 499	. . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝐹 ⊆ 𝐺 ∧ ( ·_𝑠OLD ‘𝑊) ⊆ ( ·_𝑠OLD ‘𝑈) ∧ (norm_CV‘𝑊) ⊆ (norm_CV‘𝑈)))
22	21	simp1d 1143	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹 ⊆ 𝐺)
23		ssres 6021	. . . . . . . . 9 ⊢ (𝐹 ⊆ 𝐺 → (𝐹 ↾ (𝑌 × 𝑌)) ⊆ (𝐺 ↾ (𝑌 × 𝑌)))
24	22, 23	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝐹 ↾ (𝑌 × 𝑌)) ⊆ (𝐺 ↾ (𝑌 × 𝑌)))
25	15, 24	eqsstrrd 4019	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹 ⊆ (𝐺 ↾ (𝑌 × 𝑌)))
26	6, 13, 25	3jca 1129	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (Fun (𝐺 ↾ (𝑌 × 𝑌)) ∧ 𝐹 Fn (𝑌 × 𝑌) ∧ 𝐹 ⊆ (𝐺 ↾ (𝑌 × 𝑌))))
27		oprssov 7602	. . . . . 6 ⊢ (((Fun (𝐺 ↾ (𝑌 × 𝑌)) ∧ 𝐹 Fn (𝑌 × 𝑌) ∧ 𝐹 ⊆ (𝐺 ↾ (𝑌 × 𝑌))) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐹𝑦))
28	26, 27	sylan 580	. . . . 5 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦) = (𝑥𝐹𝑦))
29	28	eqcomd 2743	. . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ 𝑌 ∧ 𝑦 ∈ 𝑌)) → (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
30	29	ralrimivva 3202	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))
31		eqid 2737	. . 3 ⊢ (𝑌 × 𝑌) = (𝑌 × 𝑌)
32	30, 31	jctil 519	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦)))
33	3	ffnd 6737	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝐺 Fn ((BaseSet‘𝑈) × (BaseSet‘𝑈)))
34	33	adantr 480	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐺 Fn ((BaseSet‘𝑈) × (BaseSet‘𝑈)))
35	1, 9, 7	sspba 30746	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ (BaseSet‘𝑈))
36		xpss12 5700	. . . . 5 ⊢ ((𝑌 ⊆ (BaseSet‘𝑈) ∧ 𝑌 ⊆ (BaseSet‘𝑈)) → (𝑌 × 𝑌) ⊆ ((BaseSet‘𝑈) × (BaseSet‘𝑈)))
37	35, 35, 36	syl2anc 584	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝑌 × 𝑌) ⊆ ((BaseSet‘𝑈) × (BaseSet‘𝑈)))
38		fnssres 6691	. . . 4 ⊢ ((𝐺 Fn ((BaseSet‘𝑈) × (BaseSet‘𝑈)) ∧ (𝑌 × 𝑌) ⊆ ((BaseSet‘𝑈) × (BaseSet‘𝑈))) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
39	34, 37, 38	syl2anc 584	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌))
40		eqfnov 7562	. . 3 ⊢ ((𝐹 Fn (𝑌 × 𝑌) ∧ (𝐺 ↾ (𝑌 × 𝑌)) Fn (𝑌 × 𝑌)) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
41	13, 39, 40	syl2anc 584	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝐹 = (𝐺 ↾ (𝑌 × 𝑌)) ↔ ((𝑌 × 𝑌) = (𝑌 × 𝑌) ∧ ∀𝑥 ∈ 𝑌 ∀𝑦 ∈ 𝑌 (𝑥𝐹𝑦) = (𝑥(𝐺 ↾ (𝑌 × 𝑌))𝑦))))
42	32, 41	mpbird 257	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝐹 = (𝐺 ↾ (𝑌 × 𝑌)))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 ∧ w3a 1087 = wceq 1540 ∈ wcel 2108 ∀wral 3061 ⊆ wss 3951 × cxp 5683 ↾ cres 5687 Fun wfun 6555 Fn wfn 6556 ⟶wf 6557 ‘cfv 6561 (class class class)co 7431 NrmCVeccnv 30603 +_𝑣 cpv 30604 BaseSetcba 30605 ·_𝑠OLD cns 30606 norm_CVcnmcv 30609 SubSpcss 30740

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 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2157 ax-12 2177 ax-ext 2708 ax-rep 5279 ax-sep 5296 ax-nul 5306 ax-pow 5365 ax-pr 5432 ax-un 7755

This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3an 1089 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2065 df-mo 2540 df-eu 2569 df-clab 2715 df-cleq 2729 df-clel 2816 df-nfc 2892 df-ne 2941 df-ral 3062 df-rex 3071 df-reu 3381 df-rab 3437 df-v 3482 df-sbc 3789 df-csb 3900 df-dif 3954 df-un 3956 df-in 3958 df-ss 3968 df-nul 4334 df-if 4526 df-pw 4602 df-sn 4627 df-pr 4629 df-op 4633 df-uni 4908 df-iun 4993 df-br 5144 df-opab 5206 df-mpt 5226 df-id 5578 df-xp 5691 df-rel 5692 df-cnv 5693 df-co 5694 df-dm 5695 df-rn 5696 df-res 5697 df-ima 5698 df-iota 6514 df-fun 6563 df-fn 6564 df-f 6565 df-f1 6566 df-fo 6567 df-f1o 6568 df-fv 6569 df-ov 7434 df-oprab 7435 df-1st 8014 df-2nd 8015 df-grpo 30512 df-ablo 30564 df-vc 30578 df-nv 30611 df-va 30614 df-ba 30615 df-sm 30616 df-0v 30617 df-nmcv 30619 df-ssp 30741

This theorem is referenced by: sspgval 30748

W3C validator