Theorem ssps 30666

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

Hypotheses

Ref	Expression
ssps.y	⊢ 𝑌 = (BaseSet‘𝑊)
ssps.s	⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
ssps.r	⊢ 𝑅 = ( ·𝑠OLD ‘𝑊)
ssps.h	⊢ 𝐻 = (SubSp‘𝑈)

Assertion

Ref	Expression
ssps	⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑆 ↾ (ℂ × 𝑌)))

Proof of Theorem ssps

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		eqid 2730	. . . . . . . . . . 11 ⊢ (BaseSet‘𝑈) = (BaseSet‘𝑈)
2		ssps.s	. . . . . . . . . . 11 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
3	1, 2	nvsf 30555	. . . . . . . . . 10 ⊢ (𝑈 ∈ NrmCVec → 𝑆:(ℂ × (BaseSet‘𝑈))⟶(BaseSet‘𝑈))
4	3	ffund 6695	. . . . . . . . 9 ⊢ (𝑈 ∈ NrmCVec → Fun 𝑆)
5	4	funresd 6562	. . . . . . . 8 ⊢ (𝑈 ∈ NrmCVec → Fun (𝑆 ↾ (ℂ × 𝑌)))
6	5	adantr 480	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → Fun (𝑆 ↾ (ℂ × 𝑌)))
7		ssps.h	. . . . . . . . . 10 ⊢ 𝐻 = (SubSp‘𝑈)
8	7	sspnv 30662	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑊 ∈ NrmCVec)
9		ssps.y	. . . . . . . . . 10 ⊢ 𝑌 = (BaseSet‘𝑊)
10		ssps.r	. . . . . . . . . 10 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊)
11	9, 10	nvsf 30555	. . . . . . . . 9 ⊢ (𝑊 ∈ NrmCVec → 𝑅:(ℂ × 𝑌)⟶𝑌)
12	8, 11	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅:(ℂ × 𝑌)⟶𝑌)
13	12	ffnd 6692	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅 Fn (ℂ × 𝑌))
14		fnresdm 6640	. . . . . . . . 9 ⊢ (𝑅 Fn (ℂ × 𝑌) → (𝑅 ↾ (ℂ × 𝑌)) = 𝑅)
15	13, 14	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝑅 ↾ (ℂ × 𝑌)) = 𝑅)
16		eqid 2730	. . . . . . . . . . . 12 ⊢ ( +𝑣 ‘𝑈) = ( +𝑣 ‘𝑈)
17		eqid 2730	. . . . . . . . . . . 12 ⊢ ( +𝑣 ‘𝑊) = ( +𝑣 ‘𝑊)
18		eqid 2730	. . . . . . . . . . . 12 ⊢ (normCV‘𝑈) = (normCV‘𝑈)
19		eqid 2730	. . . . . . . . . . . 12 ⊢ (normCV‘𝑊) = (normCV‘𝑊)
20	16, 17, 2, 10, 18, 19, 7	isssp 30660	. . . . . . . . . . 11 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ 𝑅 ⊆ 𝑆 ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈)))))
21	20	simplbda 499	. . . . . . . . . 10 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (( +𝑣 ‘𝑊) ⊆ ( +𝑣 ‘𝑈) ∧ 𝑅 ⊆ 𝑆 ∧ (normCV‘𝑊) ⊆ (normCV‘𝑈)))
22	21	simp2d 1143	. . . . . . . . 9 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅 ⊆ 𝑆)
23		ssres 5977	. . . . . . . . 9 ⊢ (𝑅 ⊆ 𝑆 → (𝑅 ↾ (ℂ × 𝑌)) ⊆ (𝑆 ↾ (ℂ × 𝑌)))
24	22, 23	syl 17	. . . . . . . 8 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝑅 ↾ (ℂ × 𝑌)) ⊆ (𝑆 ↾ (ℂ × 𝑌)))
25	15, 24	eqsstrrd 3985	. . . . . . 7 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅 ⊆ (𝑆 ↾ (ℂ × 𝑌)))
26	6, 13, 25	3jca 1128	. . . . . 6 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (Fun (𝑆 ↾ (ℂ × 𝑌)) ∧ 𝑅 Fn (ℂ × 𝑌) ∧ 𝑅 ⊆ (𝑆 ↾ (ℂ × 𝑌))))
27		oprssov 7561	. . . . . 6 ⊢ (((Fun (𝑆 ↾ (ℂ × 𝑌)) ∧ 𝑅 Fn (ℂ × 𝑌) ∧ 𝑅 ⊆ (𝑆 ↾ (ℂ × 𝑌))) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦) = (𝑥𝑅𝑦))
28	26, 27	sylan 580	. . . . 5 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ 𝑌)) → (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦) = (𝑥𝑅𝑦))
29	28	eqcomd 2736	. . . 4 ⊢ (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) ∧ (𝑥 ∈ ℂ ∧ 𝑦 ∈ 𝑌)) → (𝑥𝑅𝑦) = (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦))
30	29	ralrimivva 3181	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑌 (𝑥𝑅𝑦) = (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦))
31		eqid 2730	. . 3 ⊢ (ℂ × 𝑌) = (ℂ × 𝑌)
32	30, 31	jctil 519	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → ((ℂ × 𝑌) = (ℂ × 𝑌) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑌 (𝑥𝑅𝑦) = (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦)))
33	3	ffnd 6692	. . . . 5 ⊢ (𝑈 ∈ NrmCVec → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
34	33	adantr 480	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑆 Fn (ℂ × (BaseSet‘𝑈)))
35		ssid 3972	. . . . 5 ⊢ ℂ ⊆ ℂ
36	1, 9, 7	sspba 30663	. . . . 5 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑌 ⊆ (BaseSet‘𝑈))
37		xpss12 5656	. . . . 5 ⊢ ((ℂ ⊆ ℂ ∧ 𝑌 ⊆ (BaseSet‘𝑈)) → (ℂ × 𝑌) ⊆ (ℂ × (BaseSet‘𝑈)))
38	35, 36, 37	sylancr 587	. . . 4 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (ℂ × 𝑌) ⊆ (ℂ × (BaseSet‘𝑈)))
39		fnssres 6644	. . . 4 ⊢ ((𝑆 Fn (ℂ × (BaseSet‘𝑈)) ∧ (ℂ × 𝑌) ⊆ (ℂ × (BaseSet‘𝑈))) → (𝑆 ↾ (ℂ × 𝑌)) Fn (ℂ × 𝑌))
40	34, 38, 39	syl2anc 584	. . 3 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝑆 ↾ (ℂ × 𝑌)) Fn (ℂ × 𝑌))
41		eqfnov 7521	. . 3 ⊢ ((𝑅 Fn (ℂ × 𝑌) ∧ (𝑆 ↾ (ℂ × 𝑌)) Fn (ℂ × 𝑌)) → (𝑅 = (𝑆 ↾ (ℂ × 𝑌)) ↔ ((ℂ × 𝑌) = (ℂ × 𝑌) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑌 (𝑥𝑅𝑦) = (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦))))
42	13, 40, 41	syl2anc 584	. 2 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → (𝑅 = (𝑆 ↾ (ℂ × 𝑌)) ↔ ((ℂ × 𝑌) = (ℂ × 𝑌) ∧ ∀𝑥 ∈ ℂ ∀𝑦 ∈ 𝑌 (𝑥𝑅𝑦) = (𝑥(𝑆 ↾ (ℂ × 𝑌))𝑦))))
43	32, 42	mpbird 257	1 ⊢ ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ 𝐻) → 𝑅 = (𝑆 ↾ (ℂ × 𝑌)))

Syntax hints:   → wi 4   ↔ wb 206   ∧ wa 395   ∧ w3a 1086   = wceq 1540   ∈ wcel 2109  ∀wral 3045   ⊆ wss 3917   × cxp 5639   ↾ cres 5643  Fun wfun 6508   Fn wfn 6509  ⟶wf 6510  ‘cfv 6514  (class class class)co 7390  ℂcc 11073  NrmCVeccnv 30520   +_𝑣 cpv 30521  BaseSetcba 30522   ·_𝑠OLD cns 30523  norm_CVcnmcv 30526  SubSpcss 30657

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 2702  ax-rep 5237  ax-sep 5254  ax-nul 5264  ax-pow 5323  ax-pr 5390  ax-un 7714

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 2534  df-eu 2563  df-clab 2709  df-cleq 2722  df-clel 2804  df-nfc 2879  df-ne 2927  df-ral 3046  df-rex 3055  df-reu 3357  df-rab 3409  df-v 3452  df-sbc 3757  df-csb 3866  df-dif 3920  df-un 3922  df-in 3924  df-ss 3934  df-nul 4300  df-if 4492  df-pw 4568  df-sn 4593  df-pr 4595  df-op 4599  df-uni 4875  df-iun 4960  df-br 5111  df-opab 5173  df-mpt 5192  df-id 5536  df-xp 5647  df-rel 5648  df-cnv 5649  df-co 5650  df-dm 5651  df-rn 5652  df-res 5653  df-ima 5654  df-iota 6467  df-fun 6516  df-fn 6517  df-f 6518  df-f1 6519  df-fo 6520  df-f1o 6521  df-fv 6522  df-ov 7393  df-oprab 7394  df-1st 7971  df-2nd 7972  df-vc 30495  df-nv 30528  df-va 30531  df-ba 30532  df-sm 30533  df-0v 30534  df-nmcv 30536  df-ssp 30658

This theorem is referenced by:  sspsval  30667