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

Theorem cssval 21102
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 3462 . 2 (𝑊𝑋𝑊 ∈ V)
2 cssval.c . . 3 𝐶 = (ClSubSp‘𝑊)
3 fveq2 6843 . . . . . . . 8 (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊))
4 cssval.o . . . . . . . 8 = (ocv‘𝑊)
53, 4eqtr4di 2791 . . . . . . 7 (𝑤 = 𝑊 → (ocv‘𝑤) = )
65fveq1d 6845 . . . . . . 7 (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( 𝑠))
75, 6fveq12d 6850 . . . . . 6 (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ‘( 𝑠)))
87eqeq2d 2744 . . . . 5 (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ‘( 𝑠))))
98abbidv 2802 . . . 4 (𝑤 = 𝑊 → {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠𝑠 = ( ‘( 𝑠))})
10 df-css 21084 . . . 4 ClSubSp = (𝑤 ∈ V ↦ {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))})
11 fvex 6856 . . . . . 6 (Base‘𝑊) ∈ V
1211pwex 5336 . . . . 5 𝒫 (Base‘𝑊) ∈ V
13 id 22 . . . . . . 7 (𝑠 = ( ‘( 𝑠)) → 𝑠 = ( ‘( 𝑠)))
14 eqid 2733 . . . . . . . . 9 (Base‘𝑊) = (Base‘𝑊)
1514, 4ocvss 21090 . . . . . . . 8 ( ‘( 𝑠)) ⊆ (Base‘𝑊)
16 fvex 6856 . . . . . . . . 9 ( ‘( 𝑠)) ∈ V
1716elpw 4565 . . . . . . . 8 (( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ‘( 𝑠)) ⊆ (Base‘𝑊))
1815, 17mpbir 230 . . . . . . 7 ( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊)
1913, 18eqeltrdi 2842 . . . . . 6 (𝑠 = ( ‘( 𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊))
2019abssi 4028 . . . . 5 {𝑠𝑠 = ( ‘( 𝑠))} ⊆ 𝒫 (Base‘𝑊)
2112, 20ssexi 5280 . . . 4 {𝑠𝑠 = ( ‘( 𝑠))} ∈ V
229, 10, 21fvmpt 6949 . . 3 (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠𝑠 = ( ‘( 𝑠))})
232, 22eqtrid 2785 . 2 (𝑊 ∈ V → 𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
241, 23syl 17 1 (𝑊𝑋𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1542  wcel 2107  {cab 2710  Vcvv 3444  wss 3911  𝒫 cpw 4561  cfv 6497  Basecbs 17088  ocvcocv 21080  ClSubSpccss 21081
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1798  ax-4 1812  ax-5 1914  ax-6 1972  ax-7 2012  ax-8 2109  ax-9 2117  ax-10 2138  ax-11 2155  ax-12 2172  ax-ext 2704  ax-sep 5257  ax-nul 5264  ax-pow 5321  ax-pr 5385  ax-un 7673
This theorem depends on definitions:  df-bi 206  df-an 398  df-or 847  df-3an 1090  df-tru 1545  df-fal 1555  df-ex 1783  df-nf 1787  df-sb 2069  df-mo 2535  df-eu 2564  df-clab 2711  df-cleq 2725  df-clel 2811  df-nfc 2886  df-ne 2941  df-ral 3062  df-rex 3071  df-rab 3407  df-v 3446  df-dif 3914  df-un 3916  df-in 3918  df-ss 3928  df-nul 4284  df-if 4488  df-pw 4563  df-sn 4588  df-pr 4590  df-op 4594  df-uni 4867  df-br 5107  df-opab 5169  df-mpt 5190  df-id 5532  df-xp 5640  df-rel 5641  df-cnv 5642  df-co 5643  df-dm 5644  df-rn 5645  df-res 5646  df-ima 5647  df-iota 6449  df-fun 6499  df-fn 6500  df-f 6501  df-fv 6505  df-ov 7361  df-ocv 21083  df-css 21084
This theorem is referenced by:  iscss  21103
  Copyright terms: Public domain W3C validator