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

Theorem elocv 22029
Description: Elementhood in the orthocomplement of a subset (normally a subspace) of a pre-Hilbert space. (Contributed 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
elocv (𝐴 ∈ ( ⊥ ‘𝑆) ↔ (𝑆 ⊆ 𝑉 ∧ 𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ))
Distinct variable groups:   𝑥, 0   𝑥,𝐴   𝑥,𝑉   𝑥,𝑊   𝑥, ,   𝑥,𝑆
Allowed substitution hints:   𝐹(𝑥)   ⊥ (𝑥)

Proof of Theorem elocv
Dummy variables 𝑠 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 elfvdm 6950 . . . . 5 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ∈ dom ⊥ )
2 n0i 4289 . . . . . . . . 9 (𝐴 ∈ ( ⊥ ‘𝑆) → ¬ ( ⊥ ‘𝑆) = ∅)
3 ocvfval.o . . . . . . . . . . . 12 ⊥ = (ocv‘𝑊)
4 fvprc 6908 . . . . . . . . . . . 12 (¬ 𝑊 ∈ V → (ocv‘𝑊) = ∅)
53, 4eqtrid 2810 . . . . . . . . . . 11 (¬ 𝑊 ∈ V → ⊥ = ∅)
65fveq1d 6918 . . . . . . . . . 10 (¬ 𝑊 ∈ V → ( ⊥ ‘𝑆) = (∅‘𝑆))
7 0fv 6957 . . . . . . . . . 10 (∅‘𝑆) = ∅
86, 7eqtrdi 2814 . . . . . . . . 9 (¬ 𝑊 ∈ V → ( ⊥ ‘𝑆) = ∅)
92, 8nsyl2 142 . . . . . . . 8 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑊 ∈ V)
10 ocvfval.v . . . . . . . . 9 𝑉 = (Base‘𝑊)
11 ocvfval.i . . . . . . . . 9 , = (·𝑖‘𝑊)
12 ocvfval.f . . . . . . . . 9 𝐹 = (Scalar‘𝑊)
13 ocvfval.z . . . . . . . . 9 0 = (0g‘𝐹)
1410, 11, 12, 13, 3ocvfval 22027 . . . . . . . 8 (𝑊 ∈ V → ⊥ = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
159, 14syl 18 . . . . . . 7 (𝐴 ∈ ( ⊥ ‘𝑆) → ⊥ = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
1615dmeqd 5899 . . . . . 6 (𝐴 ∈ ( ⊥ ‘𝑆) → dom ⊥ = dom (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
1710fvexi 6930 . . . . . . . 8 𝑉 ∈ V
1817rabex 5307 . . . . . . 7 {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 } ∈ V
19 eqid 2763 . . . . . . 7 (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }) = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 })
2018, 19dmmpti 6713 . . . . . 6 dom (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }) = 𝒫 𝑉
2116, 20eqtrdi 2814 . . . . 5 (𝐴 ∈ ( ⊥ ‘𝑆) → dom ⊥ = 𝒫 𝑉)
221, 21eleqtrd 2866 . . . 4 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ∈ 𝒫 𝑉)
2322elpwid 4569 . . 3 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ⊆ 𝑉)
2410, 11, 12, 13, 3ocvval 22028 . . . . 5 (𝑆 ⊆ 𝑉 → ( ⊥ ‘𝑆) = {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 })
2524eleq2d 2850 . . . 4 (𝑆 ⊆ 𝑉 → (𝐴 ∈ ( ⊥ ‘𝑆) ↔ 𝐴 ∈ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 }))
26 oveq1 7458 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 , 𝑥) = (𝐴 , 𝑥))
2726eqeq1d 2765 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 , 𝑥) = 0 ↔ (𝐴 , 𝑥) = 0 ))
2827ralbidv 3189 . . . . 5 (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 ↔ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ))
2928elrab 3648 . . . 4 (𝐴 ∈ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 } ↔ (𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ))
3025, 29bitrdi 290 . . 3 (𝑆 ⊆ 𝑉 → (𝐴 ∈ ( ⊥ ‘𝑆) ↔ (𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 )))
3123, 30biadanii 834 . 2 (𝐴 ∈ ( ⊥ ‘𝑆) ↔ (𝑆 ⊆ 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 )))
32 3anass 1111 . 2 ((𝑆 ⊆ 𝑉 ∧ 𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ) ↔ (𝑆 ⊆ 𝑉 ∧ (𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 )))
3331, 32bitr4i 281 1 (𝐴 ∈ ( ⊥ ‘𝑆) ↔ (𝑆 ⊆ 𝑉 ∧ 𝐴 ∈ 𝑉 ∧ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ))
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   ↔ wb 209   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2147  ∀wral 3080  {crab 3416  Vcvv 3454   ⊆ wss 3900  ∅c0 4281  𝒫 cpw 4560   ↦ cmpt 5192  dom cdm 5658  ‘cfv 6566  (class class class)co 7451  Basecbs 17431  Scalarcsca 17475  ·𝑖cip 17477  0gc0g 17660  ocvcocv 22021
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5255  ax-nul 5266  ax-pow 5334  ax-pr 5398  ax-un 7783
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-ral 3081  df-rex 3091  df-rab 3417  df-v 3456  df-ss 3901  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4841  df-uni 4873  df-br 5109  df-opab 5174  df-mpt 5193  df-id 5553  df-xp 5664  df-rel 5665  df-cnv 5666  df-co 5667  df-dm 5668  df-rn 5669  df-res 5670  df-ima 5671  df-iota 6520  df-fun 6568  df-fn 6569  df-f 6570  df-fv 6574  df-ov 7454  df-ocv 22024
This theorem is used by:  ocvi  22030  ocvss  22031  ocvocv  22032  ocvlss  22033  ocv2ss  22034  unocv  22041  iunocv  22042  obselocv  22089  clsocv  25626  pjthlem2  25814
  Copyright terms: Public domain W3C validator