MPE Home Metamath Proof Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  MPE Home  >  Th. List  >  cssval Structured version   Visualization version   GIF version

Theorem cssval 21635
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.
StepHypRef Expression
1 elex 3459 . 2 (𝑊𝑋𝑊 ∈ V)
2 cssval.c . . 3 𝐶 = (ClSubSp‘𝑊)
3 fveq2 6832 . . . . . . . 8 (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊))
4 cssval.o . . . . . . . 8 = (ocv‘𝑊)
53, 4eqtr4di 2787 . . . . . . 7 (𝑤 = 𝑊 → (ocv‘𝑤) = )
65fveq1d 6834 . . . . . . 7 (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( 𝑠))
75, 6fveq12d 6839 . . . . . 6 (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ‘( 𝑠)))
87eqeq2d 2745 . . . . 5 (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ‘( 𝑠))))
98abbidv 2800 . . . 4 (𝑤 = 𝑊 → {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠𝑠 = ( ‘( 𝑠))})
10 df-css 21617 . . . 4 ClSubSp = (𝑤 ∈ V ↦ {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))})
11 fvex 6845 . . . . . 6 (Base‘𝑊) ∈ V
1211pwex 5323 . . . . 5 𝒫 (Base‘𝑊) ∈ V
13 id 22 . . . . . . 7 (𝑠 = ( ‘( 𝑠)) → 𝑠 = ( ‘( 𝑠)))
14 eqid 2734 . . . . . . . . 9 (Base‘𝑊) = (Base‘𝑊)
1514, 4ocvss 21623 . . . . . . . 8 ( ‘( 𝑠)) ⊆ (Base‘𝑊)
16 fvex 6845 . . . . . . . . 9 ( ‘( 𝑠)) ∈ V
1716elpw 4556 . . . . . . . 8 (( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ‘( 𝑠)) ⊆ (Base‘𝑊))
1815, 17mpbir 231 . . . . . . 7 ( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊)
1913, 18eqeltrdi 2842 . . . . . 6 (𝑠 = ( ‘( 𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊))
2019abssi 4018 . . . . 5 {𝑠𝑠 = ( ‘( 𝑠))} ⊆ 𝒫 (Base‘𝑊)
2112, 20ssexi 5265 . . . 4 {𝑠𝑠 = ( ‘( 𝑠))} ∈ V
229, 10, 21fvmpt 6939 . . 3 (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠𝑠 = ( ‘( 𝑠))})
232, 22eqtrid 2781 . 2 (𝑊 ∈ V → 𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
241, 23syl 17 1 (𝑊𝑋𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1541  wcel 2113  {cab 2712  Vcvv 3438  wss 3899  𝒫 cpw 4552  cfv 6490  Basecbs 17134  ocvcocv 21613  ClSubSpccss 21614
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1968  ax-7 2009  ax-8 2115  ax-9 2123  ax-10 2146  ax-11 2162  ax-12 2182  ax-ext 2706  ax-sep 5239  ax-nul 5249  ax-pow 5308  ax-pr 5375  ax-un 7678
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 848  df-3an 1088  df-tru 1544  df-fal 1554  df-ex 1781  df-nf 1785  df-sb 2068  df-mo 2537  df-eu 2567  df-clab 2713  df-cleq 2726  df-clel 2809  df-nfc 2883  df-ne 2931  df-ral 3050  df-rex 3059  df-rab 3398  df-v 3440  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4284  df-if 4478  df-pw 4554  df-sn 4579  df-pr 4581  df-op 4585  df-uni 4862  df-br 5097  df-opab 5159  df-mpt 5178  df-id 5517  df-xp 5628  df-rel 5629  df-cnv 5630  df-co 5631  df-dm 5632  df-rn 5633  df-res 5634  df-ima 5635  df-iota 6446  df-fun 6492  df-fn 6493  df-f 6494  df-fv 6498  df-ov 7359  df-ocv 21616  df-css 21617
This theorem is referenced by:  iscss  21636
  Copyright terms: Public domain W3C validator