Theorem isssp 31383

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 31382	. . 3 ⊢ (𝑈 ∈ NrmCVec → 𝐻 = {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)})
6	5	eleq2d 2850	. 2 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ 𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)}))
7		fveq2 6916	. . . . . 6 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = ( +𝑣 ‘𝑊))
8		isssp.f	. . . . . 6 ⊢ 𝐹 = ( +𝑣 ‘𝑊)
9	7, 8	eqtr4di 2816	. . . . 5 ⊢ (𝑤 = 𝑊 → ( +𝑣 ‘𝑤) = 𝐹)
10	9	sseq1d 3944	. . . 4 ⊢ (𝑤 = 𝑊 → (( +𝑣 ‘𝑤) ⊆ 𝐺 ↔ 𝐹 ⊆ 𝐺))
11		fveq2 6916	. . . . . 6 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = ( ·𝑠OLD ‘𝑊))
12		isssp.r	. . . . . 6 ⊢ 𝑅 = ( ·𝑠OLD ‘𝑊)
13	11, 12	eqtr4di 2816	. . . . 5 ⊢ (𝑤 = 𝑊 → ( ·𝑠OLD ‘𝑤) = 𝑅)
14	13	sseq1d 3944	. . . 4 ⊢ (𝑤 = 𝑊 → (( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ↔ 𝑅 ⊆ 𝑆))
15		fveq2 6916	. . . . . 6 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = (normCV‘𝑊))
16		isssp.m	. . . . . 6 ⊢ 𝑀 = (normCV‘𝑊)
17	15, 16	eqtr4di 2816	. . . . 5 ⊢ (𝑤 = 𝑊 → (normCV‘𝑤) = 𝑀)
18	17	sseq1d 3944	. . . 4 ⊢ (𝑤 = 𝑊 → ((normCV‘𝑤) ⊆ 𝑁 ↔ 𝑀 ⊆ 𝑁))
19	10, 14, 18	3anbi123d 1465	. . 3 ⊢ (𝑤 = 𝑊 → ((( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁) ↔ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))
20	19	elrab 3648	. 2 ⊢ (𝑊 ∈ {𝑤 ∈ NrmCVec ∣ (( +𝑣 ‘𝑤) ⊆ 𝐺 ∧ ( ·𝑠OLD ‘𝑤) ⊆ 𝑆 ∧ (normCV‘𝑤) ⊆ 𝑁)} ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁)))
21	6, 20	bitrdi 290	1 ⊢ (𝑈 ∈ NrmCVec → (𝑊 ∈ 𝐻 ↔ (𝑊 ∈ NrmCVec ∧ (𝐹 ⊆ 𝐺 ∧ 𝑅 ⊆ 𝑆 ∧ 𝑀 ⊆ 𝑁))))

This proof depends on syntax axioms:   → wi 4   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  {crab 3416   ⊆ wss 3900  ‘cfv 6566  NrmCVeccnv 31243   +_𝑣 cpv 31244   ·_𝑠OLD cns 31246  norm_CVcnmcv 31249  SubSpcss 31380

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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fo 6572  df-fv 6574  df-oprab 7455  df-1st 8035  df-2nd 8036  df-vc 31218  df-nv 31251  df-va 31254  df-sm 31256  df-nmcv 31259  df-ssp 31381

This theorem is used by:  sspid  31384  sspnv  31385  sspba  31386  sspg  31387  ssps  31389  sspn  31395  hhsst  31925  hhsssh2  31929