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

Theorem ocvval 20011
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 6201 . . . 4 (Base‘𝑊) ∈ V
31, 2eqeltri 2697 . . 3 𝑉 ∈ V
43elpw2 4828 . 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 20010 . . . . 5 (𝑊 ∈ V → = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }))
109fveq1d 6193 . . . 4 (𝑊 ∈ V → ( 𝑆) = ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆))
11 raleq 3138 . . . . . 6 (𝑠 = 𝑆 → (∀𝑦𝑠 (𝑥 , 𝑦) = 0 ↔ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 ))
1211rabbidv 3189 . . . . 5 (𝑠 = 𝑆 → {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 } = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
13 eqid 2622 . . . . 5 (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 }) = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })
143rabex 4813 . . . . 5 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ∈ V
1512, 13, 14fvmpt 6282 . . . 4 (𝑆 ∈ 𝒫 𝑉 → ((𝑠 ∈ 𝒫 𝑉 ↦ {𝑥𝑉 ∣ ∀𝑦𝑠 (𝑥 , 𝑦) = 0 })‘𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
1610, 15sylan9eq 2676 . . 3 ((𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
17 0fv 6227 . . . . 5 (∅‘𝑆) = ∅
18 fvprc 6185 . . . . . . 7 𝑊 ∈ V → (ocv‘𝑊) = ∅)
198, 18syl5eq 2668 . . . . . 6 𝑊 ∈ V → = ∅)
2019fveq1d 6193 . . . . 5 𝑊 ∈ V → ( 𝑆) = (∅‘𝑆))
21 ssrab2 3687 . . . . . 6 {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉
22 fvprc 6185 . . . . . . 7 𝑊 ∈ V → (Base‘𝑊) = ∅)
231, 22syl5eq 2668 . . . . . 6 𝑊 ∈ V → 𝑉 = ∅)
24 sseq0 3975 . . . . . 6 (({𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } ⊆ 𝑉𝑉 = ∅) → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2521, 23, 24sylancr 695 . . . . 5 𝑊 ∈ V → {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 } = ∅)
2617, 20, 253eqtr4a 2682 . . . 4 𝑊 ∈ V → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2726adantr 481 . . 3 ((¬ 𝑊 ∈ V ∧ 𝑆 ∈ 𝒫 𝑉) → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
2816, 27pm2.61ian 831 . 2 (𝑆 ∈ 𝒫 𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
294, 28sylbir 225 1 (𝑆𝑉 → ( 𝑆) = {𝑥𝑉 ∣ ∀𝑦𝑆 (𝑥 , 𝑦) = 0 })
Colors of variables: wff setvar class
Syntax hints:  ¬ wn 3  wi 4   = wceq 1483  wcel 1990  wral 2912  {crab 2916  Vcvv 3200  wss 3574  c0 3915  𝒫 cpw 4158  cmpt 4729  cfv 5888  (class class class)co 6650  Basecbs 15857  Scalarcsca 15944  ·𝑖cip 15946  0gc0g 16100  ocvcocv 20004
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1722  ax-4 1737  ax-5 1839  ax-6 1888  ax-7 1935  ax-8 1992  ax-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-sep 4781  ax-nul 4789  ax-pow 4843  ax-pr 4906  ax-un 6949
This theorem depends on definitions:  df-bi 197  df-or 385  df-an 386  df-3an 1039  df-tru 1486  df-ex 1705  df-nf 1710  df-sb 1881  df-eu 2474  df-mo 2475  df-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  df-ne 2795  df-ral 2917  df-rex 2918  df-rab 2921  df-v 3202  df-sbc 3436  df-dif 3577  df-un 3579  df-in 3581  df-ss 3588  df-nul 3916  df-if 4087  df-pw 4160  df-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-id 5024  df-xp 5120  df-rel 5121  df-cnv 5122  df-co 5123  df-dm 5124  df-rn 5125  df-res 5126  df-ima 5127  df-iota 5851  df-fun 5890  df-fn 5891  df-f 5892  df-fv 5896  df-ov 6653  df-ocv 20007
This theorem is referenced by:  elocv  20012  ocv0  20021  csscld  23048  hlhilocv  37249
  Copyright terms: Public domain W3C validator