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

Theorem ipcj 19979
Description: Conjugate of an inner product in a pre-Hilbert space. Equation I1 of [Ponnusamy] p. 362. (Contributed by NM, 1-Feb-2007.) (Revised by Mario Carneiro, 7-Oct-2015.)
Hypotheses
Ref Expression
phlsrng.f 𝐹 = (Scalar‘𝑊)
phllmhm.h , = (·𝑖𝑊)
phllmhm.v 𝑉 = (Base‘𝑊)
ipcj.i = (*𝑟𝐹)
Assertion
Ref Expression
ipcj ((𝑊 ∈ PreHil ∧ 𝐴𝑉𝐵𝑉) → ( ‘(𝐴 , 𝐵)) = (𝐵 , 𝐴))

Proof of Theorem ipcj
Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 phllmhm.v . . . . . 6 𝑉 = (Base‘𝑊)
2 phlsrng.f . . . . . 6 𝐹 = (Scalar‘𝑊)
3 phllmhm.h . . . . . 6 , = (·𝑖𝑊)
4 eqid 2622 . . . . . 6 (0g𝑊) = (0g𝑊)
5 ipcj.i . . . . . 6 = (*𝑟𝐹)
6 eqid 2622 . . . . . 6 (0g𝐹) = (0g𝐹)
71, 2, 3, 4, 5, 6isphl 19973 . . . . 5 (𝑊 ∈ PreHil ↔ (𝑊 ∈ LVec ∧ 𝐹 ∈ *-Ring ∧ ∀𝑥𝑉 ((𝑦𝑉 ↦ (𝑦 , 𝑥)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑥 , 𝑥) = (0g𝐹) → 𝑥 = (0g𝑊)) ∧ ∀𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥))))
87simp3bi 1078 . . . 4 (𝑊 ∈ PreHil → ∀𝑥𝑉 ((𝑦𝑉 ↦ (𝑦 , 𝑥)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑥 , 𝑥) = (0g𝐹) → 𝑥 = (0g𝑊)) ∧ ∀𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥)))
9 simp3 1063 . . . . 5 (((𝑦𝑉 ↦ (𝑦 , 𝑥)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑥 , 𝑥) = (0g𝐹) → 𝑥 = (0g𝑊)) ∧ ∀𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥)) → ∀𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥))
109ralimi 2952 . . . 4 (∀𝑥𝑉 ((𝑦𝑉 ↦ (𝑦 , 𝑥)) ∈ (𝑊 LMHom (ringLMod‘𝐹)) ∧ ((𝑥 , 𝑥) = (0g𝐹) → 𝑥 = (0g𝑊)) ∧ ∀𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥)) → ∀𝑥𝑉𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥))
118, 10syl 17 . . 3 (𝑊 ∈ PreHil → ∀𝑥𝑉𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥))
12 oveq1 6657 . . . . . 6 (𝑥 = 𝐴 → (𝑥 , 𝑦) = (𝐴 , 𝑦))
1312fveq2d 6195 . . . . 5 (𝑥 = 𝐴 → ( ‘(𝑥 , 𝑦)) = ( ‘(𝐴 , 𝑦)))
14 oveq2 6658 . . . . 5 (𝑥 = 𝐴 → (𝑦 , 𝑥) = (𝑦 , 𝐴))
1513, 14eqeq12d 2637 . . . 4 (𝑥 = 𝐴 → (( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥) ↔ ( ‘(𝐴 , 𝑦)) = (𝑦 , 𝐴)))
16 oveq2 6658 . . . . . 6 (𝑦 = 𝐵 → (𝐴 , 𝑦) = (𝐴 , 𝐵))
1716fveq2d 6195 . . . . 5 (𝑦 = 𝐵 → ( ‘(𝐴 , 𝑦)) = ( ‘(𝐴 , 𝐵)))
18 oveq1 6657 . . . . 5 (𝑦 = 𝐵 → (𝑦 , 𝐴) = (𝐵 , 𝐴))
1917, 18eqeq12d 2637 . . . 4 (𝑦 = 𝐵 → (( ‘(𝐴 , 𝑦)) = (𝑦 , 𝐴) ↔ ( ‘(𝐴 , 𝐵)) = (𝐵 , 𝐴)))
2015, 19rspc2v 3322 . . 3 ((𝐴𝑉𝐵𝑉) → (∀𝑥𝑉𝑦𝑉 ( ‘(𝑥 , 𝑦)) = (𝑦 , 𝑥) → ( ‘(𝐴 , 𝐵)) = (𝐵 , 𝐴)))
2111, 20syl5com 31 . 2 (𝑊 ∈ PreHil → ((𝐴𝑉𝐵𝑉) → ( ‘(𝐴 , 𝐵)) = (𝐵 , 𝐴)))
22213impib 1262 1 ((𝑊 ∈ PreHil ∧ 𝐴𝑉𝐵𝑉) → ( ‘(𝐴 , 𝐵)) = (𝐵 , 𝐴))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 384  w3a 1037   = wceq 1483  wcel 1990  wral 2912  cmpt 4729  cfv 5888  (class class class)co 6650  Basecbs 15857  *𝑟cstv 15943  Scalarcsca 15944  ·𝑖cip 15946  0gc0g 16100  *-Ringcsr 18844   LMHom clmhm 19019  LVecclvec 19102  ringLModcrglmod 19169  PreHilcphl 19969
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-9 1999  ax-10 2019  ax-11 2034  ax-12 2047  ax-13 2246  ax-ext 2602  ax-nul 4789
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-clab 2609  df-cleq 2615  df-clel 2618  df-nfc 2753  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-sn 4178  df-pr 4180  df-op 4184  df-uni 4437  df-br 4654  df-opab 4713  df-mpt 4730  df-iota 5851  df-fv 5896  df-ov 6653  df-phl 19971
This theorem is referenced by:  iporthcom  19980  ip0r  19982  ipdi  19985  ipassr  19991  cphipcj  22999  tchcphlem3  23032  ipcau2  23033  tchcphlem1  23034
  Copyright terms: Public domain W3C validator