Theorem cssval 21723

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 3509	. 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V)
2		cssval.c	. . 3 ⊢ 𝐶 = (ClSubSp‘𝑊)
3		fveq2 6920	. . . . . . . 8 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊))
4		cssval.o	. . . . . . . 8 ⊢ ⊥ = (ocv‘𝑊)
5	3, 4	eqtr4di 2798	. . . . . . 7 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = ⊥ )
6	5	fveq1d 6922	. . . . . . 7 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( ⊥ ‘𝑠))
7	5, 6	fveq12d 6927	. . . . . 6 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠)))
8	7	eqeq2d 2751	. . . . 5 ⊢ (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))))
9	8	abbidv 2811	. . . 4 ⊢ (𝑤 = 𝑊 → {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
10		df-css 21705	. . . 4 ⊢ ClSubSp = (𝑤 ∈ V ↦ {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))})
11		fvex 6933	. . . . . 6 ⊢ (Base‘𝑊) ∈ V
12	11	pwex 5398	. . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V
13		id 22	. . . . . . 7 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)))
14		eqid 2740	. . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊)
15	14, 4	ocvss 21711	. . . . . . . 8 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊)
16		fvex 6933	. . . . . . . . 9 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ V
17	16	elpw 4626	. . . . . . . 8 ⊢ (( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊))
18	15, 17	mpbir 231	. . . . . . 7 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊)
19	13, 18	eqeltrdi 2852	. . . . . 6 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊))
20	19	abssi 4093	. . . . 5 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ⊆ 𝒫 (Base‘𝑊)
21	12, 20	ssexi 5340	. . . 4 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ∈ V
22	9, 10, 21	fvmpt 7029	. . 3 ⊢ (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
23	2, 22	eqtrid 2792	. 2 ⊢ (𝑊 ∈ V → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})
24	1, 23	syl 17	1 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})

Syntax hints:   → wi 4   = wceq 1537   ∈ wcel 2108  {cab 2717  Vcvv 3488   ⊆ wss 3976  𝒫 cpw 4622  ‘cfv 6573  Basecbs 17258  ocvcocv 21701  ClSubSpccss 21702

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1793  ax-4 1807  ax-5 1909  ax-6 1967  ax-7 2007  ax-8 2110  ax-9 2118  ax-10 2141  ax-11 2158  ax-12 2178  ax-ext 2711  ax-sep 5317  ax-nul 5324  ax-pow 5383  ax-pr 5447  ax-un 7770

This theorem depends on definitions:  df-bi 207  df-an 396  df-or 847  df-3an 1089  df-tru 1540  df-fal 1550  df-ex 1778  df-nf 1782  df-sb 2065  df-mo 2543  df-eu 2572  df-clab 2718  df-cleq 2732  df-clel 2819  df-nfc 2895  df-ne 2947  df-ral 3068  df-rex 3077  df-rab 3444  df-v 3490  df-dif 3979  df-un 3981  df-in 3983  df-ss 3993  df-nul 4353  df-if 4549  df-pw 4624  df-sn 4649  df-pr 4651  df-op 4655  df-uni 4932  df-br 5167  df-opab 5229  df-mpt 5250  df-id 5593  df-xp 5706  df-rel 5707  df-cnv 5708  df-co 5709  df-dm 5710  df-rn 5711  df-res 5712  df-ima 5713  df-iota 6525  df-fun 6575  df-fn 6576  df-f 6577  df-fv 6581  df-ov 7451  df-ocv 21704  df-css 21705

This theorem is referenced by:  iscss  21724