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

Theorem ocvval 20629
Description: Value of the orthocomplement of a subset (normally a subspace) of a pre-Hilbert space. (Contributed by NM, 7-Oct-2011.) (Revised by Mario Carneiro, 13-Oct-2015.)
Hypotheses
Ref Expression
ocvfval.v 𝑉 = (Base‘𝑊)
ocvfval.i , = (·𝑖𝑊)
ocvfval.f 𝐹 = (Scalar‘𝑊)
ocvfval.z 0 = (0g𝐹)
ocvfval.o = (ocv‘𝑊)
Assertion
Ref Expression
ocvval (𝑆𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
Distinct variable groups:   𝑥,𝑦, 0   𝑥,𝑉,𝑦   𝑥,𝑊,𝑦   𝑥, , ,𝑦   𝑥,𝑆,𝑦
Allowed substitution hints:   𝐹(𝑥,𝑦)   (𝑥,𝑦)

Proof of Theorem ocvval
Dummy variable 𝑠 is distinct from all other variables.
StepHypRef Expression
1 ocvfval.v . . . 4 𝑉 = (Base‘𝑊)
21fvexi 6731 . . 3 𝑉 ∈ V
32elpw2 5238 . 2 (𝑆 ∈ 𝒫 𝑉𝑆𝑉)
4 ocvfval.i . . . . . 6 , = (·𝑖𝑊)
5 ocvfval.f . . . . . 6 𝐹 = (Scalar‘𝑊)
6 ocvfval.z . . . . . 6 0 = (0g𝐹)
7 ocvfval.o . . . . . 6 = (ocv‘𝑊)
81, 4, 5, 6, 7ocvfval 20628 . . . . 5 (𝑊 ∈ V → = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }))
98fveq1d 6719 . . . 4 (𝑊 ∈ V → ( 𝑆) = ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆))
10 raleq 3319 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦𝑠 (𝑥 , 𝑦) = 0 ↔ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 ))
1110rabbidv 3390 . . . . 5 (𝑠 = 𝑆 → {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 } = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
12 eqid 2737 . . . . 5 (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }) = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })
132rabex 5225 . . . . 5 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ∈ V
1411, 12, 13fvmpt 6818 . . . 4 (𝑆 ∈ 𝒫 𝑉 → ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
159, 14sylan9eq 2798 . . 3 ((𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
16 0fv 6756 . . . . 5 (∅‘𝑆) = ∅
17 fvprc 6709 . . . . . . 7 𝑊 ∈ V → (ocv‘𝑊) = ∅)
187, 17syl5eq 2790 . . . . . 6 𝑊 ∈ V → = ∅)
1918fveq1d 6719 . . . . 5 𝑊 ∈ V → ( 𝑆) = (∅‘𝑆))
20 ssrab2 3993 . . . . . 6 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉
21 fvprc 6709 . . . . . . 7 𝑊 ∈ V → (Base‘𝑊) = ∅)
221, 21syl5eq 2790 . . . . . 6 𝑊 ∈ V → 𝑉 = ∅)
23 sseq0 4314 . . . . . 6 (({𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉𝑉 = ∅) → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2420, 22, 23sylancr 590 . . . . 5 𝑊 ∈ V → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2516, 19, 243eqtr4a 2804 . . . 4 𝑊 ∈ V → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2625adantr 484 . . 3 ((¬ 𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2715, 26pm2.61ian 812 . 2 (𝑆 ∈ 𝒫 𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
283, 27sylbir 238 1 (𝑆𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1543  wcel 2110  wral 3061  {crab 3065  Vcvv 3408  wss 3866  c0 4237  𝒫 cpw 4513  cmpt 5135  cfv 6380  (class class class)co 7213  Basecbs 16760  Scalarcsca 16805  ·𝑖cip 16807  0gc0g 16944  ocvcocv 20622
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1803  ax-4 1817  ax-5 1918  ax-6 1976  ax-7 2016  ax-8 2112  ax-9 2120  ax-10 2141  ax-11 2158  ax-12 2175  ax-ext 2708  ax-sep 5192  ax-nul 5199  ax-pow 5258  ax-pr 5322  ax-un 7523
This theorem depends on definitions:  df-bi 210  df-an 400  df-or 848  df-3an 1091  df-tru 1546  df-fal 1556  df-ex 1788  df-nf 1792  df-sb 2071  df-mo 2539  df-eu 2568  df-clab 2715  df-cleq 2729  df-clel 2816  df-nfc 2886  df-ne 2941  df-ral 3066  df-rex 3067  df-rab 3070  df-v 3410  df-dif 3869  df-un 3871  df-in 3873  df-ss 3883  df-nul 4238  df-if 4440  df-pw 4515  df-sn 4542  df-pr 4544  df-op 4548  df-uni 4820  df-br 5054  df-opab 5116  df-mpt 5136  df-id 5455  df-xp 5557  df-rel 5558  df-cnv 5559  df-co 5560  df-dm 5561  df-rn 5562  df-res 5563  df-ima 5564  df-iota 6338  df-fun 6382  df-fn 6383  df-f 6384  df-fv 6388  df-ov 7216  df-ocv 20625
This theorem is referenced by:  elocv  20630  ocv0  20639  csscld  24146  hlhilocv  39708
  Copyright terms: Public domain W3C validator