Theorem cssval 20026

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 ` W )
cssval.c	|- C = ( CSubSp ` W )

Assertion

Ref	Expression
cssval	|- ( W e. X -> C = { s | s = ( ._|_ ` ( ._|_ ` s ) ) } )

Distinct variable groups:   ._|_ , s   W, s

Allowed substitution hints:   C( s)   X( s)

Proof of Theorem cssval

Dummy variable w is distinct from all other variables.

Step	Hyp	Ref	Expression
1		elex 3212	. 2 |- ( W e. X -> W e. _V )
2		cssval.c	. . 3 |- C = ( CSubSp ` W )
3		fveq2 6191	. . . . . . . 8 |- ( w = W -> ( ocv ` w ) = ( ocv ` W ) )
4		cssval.o	. . . . . . . 8 |- ._|_ = ( ocv ` W )
5	3, 4	syl6eqr 2674	. . . . . . 7 |- ( w = W -> ( ocv ` w ) = ._|_ )
6	5	fveq1d 6193	. . . . . . 7 |- ( w = W -> ( ( ocv ` w ) ` s ) = ( ._|_ ` s ) )
7	5, 6	fveq12d 6197	. . . . . 6 |- ( w = W -> ( ( ocv ` w ) ` ( ( ocv ` w ) ` s ) ) = ( ._|_ ` ( ._|_ ` s ) ) )
8	7	eqeq2d 2632	. . . . 5 |- ( w = W -> ( s = ( ( ocv ` w ) ` ( ( ocv ` w ) ` s ) ) <-> s = ( ._|_ ` ( ._|_ ` s ) ) ) )
9	8	abbidv 2741	. . . 4 |- ( w = W -> { s | s = ( ( ocv ` w ) ` ( ( ocv ` w ) ` s ) ) } = { s | s = ( ._|_ ` ( ._|_ ` s ) ) } )
10		df-css 20008	. . . 4 |- CSubSp = ( w e. _V |-> { s | s = ( ( ocv ` w ) ` ( ( ocv ` w ) ` s ) ) } )
11		fvex 6201	. . . . . 6 |- ( Base ` W ) e. _V
12	11	pwex 4848	. . . . 5 |- ~P ( Base ` W ) e. _V
13		id 22	. . . . . . 7 |- ( s = ( ._|_ ` ( ._|_ ` s ) ) -> s = ( ._|_ ` ( ._|_ ` s ) ) )
14		eqid 2622	. . . . . . . . 9 |- ( Base ` W ) = ( Base ` W )
15	14, 4	ocvss 20014	. . . . . . . 8 |- ( ._|_ ` ( ._|_ ` s ) ) C_ ( Base ` W )
16		fvex 6201	. . . . . . . . 9 |- ( ._|_ ` ( ._|_ ` s ) ) e. _V
17	16	elpw 4164	. . . . . . . 8 |- ( ( ._|_ ` ( ._|_ ` s ) ) e. ~P ( Base ` W ) <-> ( ._|_ ` ( ._|_ ` s ) ) C_ ( Base ` W ) )
18	15, 17	mpbir 221	. . . . . . 7 |- ( ._|_ ` ( ._|_ ` s ) ) e. ~P ( Base ` W )
19	13, 18	syl6eqel 2709	. . . . . 6 |- ( s = ( ._|_ ` ( ._|_ ` s ) ) -> s e. ~P ( Base ` W ) )
20	19	abssi 3677	. . . . 5 |- { s | s = ( ._|_ ` ( ._|_ ` s ) ) } C_ ~P ( Base ` W )
21	12, 20	ssexi 4803	. . . 4 |- { s | s = ( ._|_ ` ( ._|_ ` s ) ) } e. _V
22	9, 10, 21	fvmpt 6282	. . 3 |- ( W e. _V -> ( CSubSp ` W ) = { s | s = ( ._|_ ` ( ._|_ ` s ) ) } )
23	2, 22	syl5eq 2668	. 2 |- ( W e. _V -> C = { s | s = ( ._|_ ` ( ._|_ ` s ) ) } )
24	1, 23	syl 17	1 |- ( W e. X -> C = { s | s = ( ._|_ ` ( ._|_ ` s ) ) } )

Syntax hints:   -> wi 4   = wceq 1483   e. wcel 1990   {cab 2608   _Vcvv 3200   C_ wss 3574   ~Pcpw 4158   ` cfv 5888   Basecbs 15857   ocvcocv 20004   CSubSpccss 20005

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949

This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-ocv 20007  df-css 20008

This theorem is referenced by:  iscss  20027