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

Theorem ocvval 19830
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‘𝑊)
2 fvex 6113 . . . 4 (Base‘𝑊) ∈ V
31, 2eqeltri 2684 . . 3 𝑉 ∈ V
43elpw2 4755 . 2 (𝑆 ∈ 𝒫 𝑉𝑆𝑉)
5 ocvfval.i . . . . . 6 , = (·𝑖𝑊)
6 ocvfval.f . . . . . 6 𝐹 = (Scalar‘𝑊)
7 ocvfval.z . . . . . 6 0 = (0g𝐹)
8 ocvfval.o . . . . . 6 = (ocv‘𝑊)
91, 5, 6, 7, 8ocvfval 19829 . . . . 5 (𝑊 ∈ V → = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }))
109fveq1d 6105 . . . 4 (𝑊 ∈ V → ( 𝑆) = ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆))
11 raleq 3115 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦𝑠 (𝑥 , 𝑦) = 0 ↔ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 ))
1211rabbidv 3164 . . . . 5 (𝑠 = 𝑆 → {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 } = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
13 eqid 2610 . . . . 5 (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }) = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })
143rabex 4740 . . . . 5 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ∈ V
1512, 13, 14fvmpt 6191 . . . 4 (𝑆 ∈ 𝒫 𝑉 → ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
1610, 15sylan9eq 2664 . . 3 ((𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
17 0fv 6137 . . . . 5 (∅‘𝑆) = ∅
18 fvprc 6097 . . . . . . 7 𝑊 ∈ V → (ocv‘𝑊) = ∅)
198, 18syl5eq 2656 . . . . . 6 𝑊 ∈ V → = ∅)
2019fveq1d 6105 . . . . 5 𝑊 ∈ V → ( 𝑆) = (∅‘𝑆))
21 ssrab2 3650 . . . . . 6 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉
22 fvprc 6097 . . . . . . 7 𝑊 ∈ V → (Base‘𝑊) = ∅)
231, 22syl5eq 2656 . . . . . 6 𝑊 ∈ V → 𝑉 = ∅)
24 sseq0 3927 . . . . . 6 (({𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉𝑉 = ∅) → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2521, 23, 24sylancr 694 . . . . 5 𝑊 ∈ V → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2617, 20, 253eqtr4a 2670 . . . 4 𝑊 ∈ V → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2726adantr 480 . . 3 ((¬ 𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2816, 27pm2.61ian 827 . 2 (𝑆 ∈ 𝒫 𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
294, 28sylbir 224 1 (𝑆𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1475  wcel 1977  wral 2896  {crab 2900  Vcvv 3173  wss 3540  c0 3874  𝒫 cpw 4108  cmpt 4643  cfv 5804  (class class class)co 6549  Basecbs 15695  Scalarcsca 15771  ·𝑖cip 15773  0gc0g 15923  ocvcocv 19823
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1713  ax-4 1728  ax-5 1827  ax-6 1875  ax-7 1922  ax-8 1979  ax-9 1986  ax-10 2006  ax-11 2021  ax-12 2034  ax-13 2234  ax-ext 2590  ax-sep 4709  ax-nul 4717  ax-pow 4769  ax-pr 4833  ax-un 6847
This theorem depends on definitions:  df-bi 196  df-or 384  df-an 385  df-3an 1033  df-tru 1478  df-ex 1696  df-nf 1701  df-sb 1868  df-eu 2462  df-mo 2463  df-clab 2597  df-cleq 2603  df-clel 2606  df-nfc 2740  df-ne 2782  df-ral 2901  df-rex 2902  df-rab 2905  df-v 3175  df-sbc 3403  df-dif 3543  df-un 3545  df-in 3547  df-ss 3554  df-nul 3875  df-if 4037  df-pw 4110  df-sn 4126  df-pr 4128  df-op 4132  df-uni 4373  df-br 4584  df-opab 4644  df-mpt 4645  df-id 4953  df-xp 5044  df-rel 5045  df-cnv 5046  df-co 5047  df-dm 5048  df-rn 5049  df-res 5050  df-ima 5051  df-iota 5768  df-fun 5806  df-fn 5807  df-f 5808  df-fv 5812  df-ov 6552  df-ocv 19826
This theorem is referenced by:  elocv  19831  ocv0  19840  csscld  22856  hlhilocv  36267
  Copyright terms: Public domain W3C validator