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

Theorem elocv 21967
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 6917 . . . . 5 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ∈ dom ⊥ )
2 n0i 4286 . . . . . . . . 9 (𝐴 ∈ ( ⊥ ‘𝑆) → ¬ ( ⊥ ‘𝑆) = ∅)
3 ocvfval.o . . . . . . . . . . . 12 ⊥ = (ocv‘𝑊)
4 fvprc 6875 . . . . . . . . . . . 12 (¬ 𝑊 ∈ V → (ocv‘𝑊) = ∅)
53, 4eqtrid 2808 . . . . . . . . . . 11 (¬ 𝑊 ∈ V → ⊥ = ∅)
65fveq1d 6885 . . . . . . . . . 10 (¬ 𝑊 ∈ V → ( ⊥ ‘𝑆) = (∅‘𝑆))
7 0fv 6924 . . . . . . . . . 10 (∅‘𝑆) = ∅
86, 7eqtrdi 2812 . . . . . . . . 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 21965 . . . . . . . 8 (𝑊 ∈ V → ⊥ = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
159, 14syl 18 . . . . . . 7 (𝐴 ∈ ( ⊥ ‘𝑆) → ⊥ = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
1615dmeqd 5887 . . . . . 6 (𝐴 ∈ ( ⊥ ‘𝑆) → dom ⊥ = dom (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }))
1710fvexi 6897 . . . . . . . 8 𝑉 ∈ V
1817rabex 5300 . . . . . . 7 {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 } ∈ V
19 eqid 2761 . . . . . . 7 (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }) = (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 })
2018, 19dmmpti 6681 . . . . . 6 dom (𝑠 ∈ 𝒫 𝑉 ↦ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑠 (𝑦 , 𝑥) = 0 }) = 𝒫 𝑉
2116, 20eqtrdi 2812 . . . . 5 (𝐴 ∈ ( ⊥ ‘𝑆) → dom ⊥ = 𝒫 𝑉)
221, 21eleqtrd 2863 . . . 4 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ∈ 𝒫 𝑉)
2322elpwid 4566 . . 3 (𝐴 ∈ ( ⊥ ‘𝑆) → 𝑆 ⊆ 𝑉)
2410, 11, 12, 13, 3ocvval 21966 . . . . 5 (𝑆 ⊆ 𝑉 → ( ⊥ ‘𝑆) = {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 })
2524eleq2d 2847 . . . 4 (𝑆 ⊆ 𝑉 → (𝐴 ∈ ( ⊥ ‘𝑆) ↔ 𝐴 ∈ {𝑦 ∈ 𝑉 ∣ ∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 }))
26 oveq1 7425 . . . . . . 7 (𝑦 = 𝐴 → (𝑦 , 𝑥) = (𝐴 , 𝑥))
2726eqeq1d 2763 . . . . . 6 (𝑦 = 𝐴 → ((𝑦 , 𝑥) = 0 ↔ (𝐴 , 𝑥) = 0 ))
2827ralbidv 3186 . . . . 5 (𝑦 = 𝐴 → (∀𝑥 ∈ 𝑆 (𝑦 , 𝑥) = 0 ↔ ∀𝑥 ∈ 𝑆 (𝐴 , 𝑥) = 0 ))
2928elrab 3645 . . . 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 2145  ∀wral 3077  {crab 3413  Vcvv 3451   ⊆ wss 3899  ∅c0 4279  𝒫 cpw 4557   ↦ cmpt 5186  dom cdm 5651  ‘cfv 6537  (class class class)co 7418  Basecbs 17380  Scalarcsca 17424  ·𝑖cip 17426  0gc0g 17603  ocvcocv 21959
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 1943  ax-6 2000  ax-7 2041  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2213  ax-ext 2733  ax-sep 5249  ax-nul 5260  ax-pow 5327  ax-pr 5391  ax-un 7749
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 2100  df-mo 2565  df-eu 2595  df-clab 2740  df-cleq 2753  df-clel 2836  df-nfc 2910  df-ne 2957  df-ral 3078  df-rex 3088  df-rab 3414  df-v 3453  df-dif 3902  df-un 3904  df-in 3906  df-ss 3916  df-nul 4280  df-if 4483  df-pw 4559  df-sn 4585  df-pr 4587  df-op 4591  df-uni 4868  df-br 5104  df-opab 5168  df-mpt 5187  df-id 5546  df-xp 5657  df-rel 5658  df-cnv 5659  df-co 5660  df-dm 5661  df-rn 5662  df-res 5663  df-ima 5664  df-iota 6493  df-fun 6539  df-fn 6540  df-f 6541  df-fv 6545  df-ov 7421  df-ocv 21962
This theorem is used by:  ocvi  21968  ocvss  21969  ocvocv  21970  ocvlss  21971  ocv2ss  21972  unocv  21979  iunocv  21980  obselocv  22027  clsocv  25564  pjthlem2  25752
  Copyright terms: Public domain W3C validator