Theorem cssval 21589

Description: The set of closed subspaces of a pre-Hilbert space. (Contributed by NM, 7-Oct-2011.) (Revised by Mario Carneiro, 13-Oct-2015.)

Hypotheses

Ref	Expression
cssval.o	⊢ ⊥ = (ocv‘𝑊)
cssval.c	⊢ 𝐶 = (ClSubSp‘𝑊)

Assertion

Ref	Expression
cssval	⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})

Distinct variable groups:   ⊥ ,𝑠   𝑊,𝑠

Allowed substitution hints:   𝐶(𝑠)   𝑋(𝑠)

Proof of Theorem cssval

Dummy variable 𝑤 is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3457	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		cssval.c	. . 3 ⊢ 𝐶 = (ClSubSp‘𝑊)
3		fveq2 6822	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊))
4		cssval.o	. . . . . . . 8 ⊢ ⊥ = (ocv‘𝑊)
5	3, 4	eqtr4di 2782	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = ⊥ )
6	5	fveq1d 6824	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( ⊥ ‘𝑠))
7	5, 6	fveq12d 6829	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠)))
8	7	eqeq2d 2740	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))))
9	8	abbidv 2795	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
10		df-css 21571	. . . 4 ⊢ ClSubSp = (𝑤 ∈ V ↦ {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))})
11		fvex 6835	. . . . . 6 ⊢ (Base‘𝑊) ∈ V
12	11	pwex 5319	. . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V
13		id 22	. . . . . . 7 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)))
14		eqid 2729	. . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊)
15	14, 4	ocvss 21577	. . . . . . . 8 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊)
16		fvex 6835	. . . . . . . . 9 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ V
17	16	elpw 4555	. . . . . . . 8 ⊢ (( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊))
18	15, 17	mpbir 231	. . . . . . 7 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊)
19	13, 18	eqeltrdi 2836	. . . . . 6 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊))
20	19	abssi 4021	. . . . 5 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ⊆ 𝒫 (Base‘𝑊)
21	12, 20	ssexi 5261	. . . 4 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ∈ V
22	9, 10, 21	fvmpt 6930	. . 3 ⊢ (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
23	2, 22	eqtrid 2776	. 2 ⊢ (𝑊 ∈ V → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
24	1, 23	syl 17	1 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})

Syntax hints:   → wi 4   = wceq 1540   ∈ wcel 2109  {cab 2707  Vcvv 3436   ⊆ wss 3903  𝒫 cpw 4551  ‘cfv 6482  Basecbs 17120  ocvcocv 21567  ClSubSpccss 21568

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 2701  ax-sep 5235  ax-nul 5245  ax-pow 5304  ax-pr 5371  ax-un 7671

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 2533  df-eu 2562  df-clab 2708  df-cleq 2721  df-clel 2803  df-nfc 2878  df-ne 2926  df-ral 3045  df-rex 3054  df-rab 3395  df-v 3438  df-dif 3906  df-un 3908  df-in 3910  df-ss 3920  df-nul 4285  df-if 4477  df-pw 4553  df-sn 4578  df-pr 4580  df-op 4584  df-uni 4859  df-br 5093  df-opab 5155  df-mpt 5174  df-id 5514  df-xp 5625  df-rel 5626  df-cnv 5627  df-co 5628  df-dm 5629  df-rn 5630  df-res 5631  df-ima 5632  df-iota 6438  df-fun 6484  df-fn 6485  df-f 6486  df-fv 6490  df-ov 7352  df-ocv 21570  df-css 21571

This theorem is referenced by:  iscss  21590