Theorem isssp 30533

Description: The predicate "is a subspace." (Contributed by NM, 26-Jan-2008.) (New usage is discouraged.)

Hypotheses

Ref	Expression
isssp.g	⊢ 𝐺 = ( +𝑣 ‘𝑈)
isssp.f	⊢ 𝐹 = ( +𝑣 ‘𝑊)
isssp.s	⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
isssp.r	⊢ 𝑅 = ( ·𝑠OLD ‘𝑊)
isssp.n	⊢ 𝑁 = (normCV‘𝑈)
isssp.m	⊢ 𝑀 = (normCV‘𝑊)
isssp.h	⊢ 𝐻 = (SubSp‘𝑈)

Assertion

Ref	Expression
isssp	⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))))

Proof of Theorem isssp

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		isssp.g	. . . 4 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
2		isssp.s	. . . 4 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
3		isssp.n	. . . 4 ⊢ 𝑁 = (normCV‘𝑈)
4		isssp.h	. . . 4 ⊢ 𝐻 = (SubSp‘𝑈)
5	1, 2, 3, 4	sspval 30532	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐻 = {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)})
6	5	eleq2d 2815	. 2 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ 𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)}))
7		fveq2 6897	. . . . . 6 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = ( +𝑣 ‘𝑊))
8		isssp.f	. . . . . 6 ⊢ 𝐹 = ( +𝑣 ‘𝑊)
9	7, 8	eqtr4di 2786	. . . . 5 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = 𝐹)
10	9	sseq1d 4011	. . . 4 ⊢ (𝑤 = 𝑊 → (( +𝑣 ‘𝑤) ⊆ 𝐺 ↔ 𝐹 ⊆ 𝐺))
11		fveq2 6897	. . . . . 6 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = ( ·𝑠OLD ‘𝑊))
12		isssp.r	. . . . . 6 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊)
13	11, 12	eqtr4di 2786	. . . . 5 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = 𝑅)
14	13	sseq1d 4011	. . . 4 ⊢ (𝑤 = 𝑊 → (( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆))
15		fveq2 6897	. . . . . 6 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = (normCV‘𝑊))
16		isssp.m	. . . . . 6 ⊢ 𝑀 = (normCV‘𝑊)
17	15, 16	eqtr4di 2786	. . . . 5 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = 𝑀)
18	17	sseq1d 4011	. . . 4 ⊢ (𝑤 = 𝑊 → ((normCV‘𝑤) ⊆ 𝑁 ↔ 𝑀 ⊆ 𝑁))
19	10, 14, 18	3anbi123d 1433	. . 3 ⊢ (𝑤 = 𝑊 → ((( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁) ↔ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))
20	19	elrab 3682	. 2 ⊢ (𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)} ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))
21	6, 20	bitrdi 287	1 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))))

Syntax hints:   → wi 4   ↔ wb 205   ∧ wa 395   ∧ w3a 1085   = wceq 1534   ∈ wcel 2099  {crab 3429   ⊆ wss 3947  ‘cfv 6548  NrmCVeccnv 30393   +_𝑣 cpv 30394   ·_𝑠OLD cns 30396  norm_CVcnmcv 30399  SubSpcss 30530

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 1906  ax-6 1964  ax-7 2004  ax-8 2101  ax-9 2109  ax-10 2130  ax-11 2147  ax-12 2167  ax-ext 2699  ax-sep 5299  ax-nul 5306  ax-pow 5365  ax-pr 5429  ax-un 7740

This theorem depends on definitions:  df-bi 206  df-an 396  df-or 847  df-3an 1087  df-tru 1537  df-fal 1547  df-ex 1775  df-nf 1779  df-sb 2061  df-mo 2530  df-eu 2559  df-clab 2706  df-cleq 2720  df-clel 2806  df-nfc 2881  df-ne 2938  df-ral 3059  df-rex 3068  df-rab 3430  df-v 3473  df-dif 3950  df-un 3952  df-in 3954  df-ss 3964  df-nul 4324  df-if 4530  df-pw 4605  df-sn 4630  df-pr 4632  df-op 4636  df-uni 4909  df-br 5149  df-opab 5211  df-mpt 5232  df-id 5576  df-xp 5684  df-rel 5685  df-cnv 5686  df-co 5687  df-dm 5688  df-rn 5689  df-res 5690  df-ima 5691  df-iota 6500  df-fun 6550  df-fn 6551  df-f 6552  df-fo 6554  df-fv 6556  df-oprab 7424  df-1st 7993  df-2nd 7994  df-vc 30368  df-nv 30401  df-va 30404  df-sm 30406  df-nmcv 30409  df-ssp 30531

This theorem is referenced by:  sspid  30534  sspnv  30535  sspba  30536  sspg  30537  ssps  30539  sspn  30545  hhsst  31075  hhsssh2  31079

Otomatik - 173.255.232.114 CloudFlare DNS Türk Telekom DNS Google DNS Open DNS

OSZAR »