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

Theorem cssval 21571
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 3487 . 2 (𝑊𝑋𝑊 ∈ V)
2 cssval.c . . 3 𝐶 = (ClSubSp‘𝑊)
3 fveq2 6884 . . . . . . . 8 (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊))
4 cssval.o . . . . . . . 8 = (ocv‘𝑊)
53, 4eqtr4di 2784 . . . . . . 7 (𝑤 = 𝑊 → (ocv‘𝑤) = )
65fveq1d 6886 . . . . . . 7 (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( 𝑠))
75, 6fveq12d 6891 . . . . . 6 (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ‘( 𝑠)))
87eqeq2d 2737 . . . . 5 (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ‘( 𝑠))))
98abbidv 2795 . . . 4 (𝑤 = 𝑊 → {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠𝑠 = ( ‘( 𝑠))})
10 df-css 21553 . . . 4 ClSubSp = (𝑤 ∈ V ↦ {𝑠𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))})
11 fvex 6897 . . . . . 6 (Base‘𝑊) ∈ V
1211pwex 5371 . . . . 5 𝒫 (Base‘𝑊) ∈ V
13 id 22 . . . . . . 7 (𝑠 = ( ‘( 𝑠)) → 𝑠 = ( ‘( 𝑠)))
14 eqid 2726 . . . . . . . . 9 (Base‘𝑊) = (Base‘𝑊)
1514, 4ocvss 21559 . . . . . . . 8 ( ‘( 𝑠)) ⊆ (Base‘𝑊)
16 fvex 6897 . . . . . . . . 9 ( ‘( 𝑠)) ∈ V
1716elpw 4601 . . . . . . . 8 (( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ‘( 𝑠)) ⊆ (Base‘𝑊))
1815, 17mpbir 230 . . . . . . 7 ( ‘( 𝑠)) ∈ 𝒫 (Base‘𝑊)
1913, 18eqeltrdi 2835 . . . . . 6 (𝑠 = ( ‘( 𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊))
2019abssi 4062 . . . . 5 {𝑠𝑠 = ( ‘( 𝑠))} ⊆ 𝒫 (Base‘𝑊)
2112, 20ssexi 5315 . . . 4 {𝑠𝑠 = ( ‘( 𝑠))} ∈ V
229, 10, 21fvmpt 6991 . . 3 (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠𝑠 = ( ‘( 𝑠))})
232, 22eqtrid 2778 . 2 (𝑊 ∈ V → 𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
241, 23syl 17 1 (𝑊𝑋𝐶 = {𝑠𝑠 = ( ‘( 𝑠))})
Colors of variables: wff setvar class
Syntax hints:  wi 4   = wceq 1533  wcel 2098  {cab 2703  Vcvv 3468  wss 3943  𝒫 cpw 4597  cfv 6536  Basecbs 17151  ocvcocv 21549  ClSubSpccss 21550
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1789  ax-4 1803  ax-5 1905  ax-6 1963  ax-7 2003  ax-8 2100  ax-9 2108  ax-10 2129  ax-11 2146  ax-12 2163  ax-ext 2697  ax-sep 5292  ax-nul 5299  ax-pow 5356  ax-pr 5420  ax-un 7721
This theorem depends on definitions:  df-bi 206  df-an 396  df-or 845  df-3an 1086  df-tru 1536  df-fal 1546  df-ex 1774  df-nf 1778  df-sb 2060  df-mo 2528  df-eu 2557  df-clab 2704  df-cleq 2718  df-clel 2804  df-nfc 2879  df-ne 2935  df-ral 3056  df-rex 3065  df-rab 3427  df-v 3470  df-dif 3946  df-un 3948  df-in 3950  df-ss 3960  df-nul 4318  df-if 4524  df-pw 4599  df-sn 4624  df-pr 4626  df-op 4630  df-uni 4903  df-br 5142  df-opab 5204  df-mpt 5225  df-id 5567  df-xp 5675  df-rel 5676  df-cnv 5677  df-co 5678  df-dm 5679  df-rn 5680  df-res 5681  df-ima 5682  df-iota 6488  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7407  df-ocv 21552  df-css 21553
This theorem is referenced by:  iscss  21572
  Copyright terms: Public domain W3C validator