Theorem obsip 22007

Description: The inner product of two elements of an orthonormal basis. (Contributed by Mario Carneiro, 23-Oct-2015.)

Hypotheses

Ref	Expression
isobs.v	⊢ 𝑉 = (Base‘𝑊)
isobs.h	⊢ , = (·𝑖‘𝑊)
isobs.f	⊢ 𝐹 = (Scalar‘𝑊)
isobs.u	⊢ 1 = (1r‘𝐹)
isobs.z	⊢ 0 = (0g‘𝐹)

Assertion

Ref	Expression
obsip	⊢ ((𝐵 ∈ (OBasis‘𝑊) ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 , 𝑄) = if(𝑃 = 𝑄, 1 , 0 ))

Proof of Theorem obsip

Dummy variables 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		isobs.v	. . . . . 6 ⊢ 𝑉 = (Base‘𝑊)
2		isobs.h	. . . . . 6 ⊢ , = (·𝑖‘𝑊)
3		isobs.f	. . . . . 6 ⊢ 𝐹 = (Scalar‘𝑊)
4		isobs.u	. . . . . 6 ⊢ 1 = (1r‘𝐹)
5		isobs.z	. . . . . 6 ⊢ 0 = (0g‘𝐹)
6		eqid 2761	. . . . . 6 ⊢ (ocv‘𝑊) = (ocv‘𝑊)
7		eqid 2761	. . . . . 6 ⊢ (0g‘𝑊) = (0g‘𝑊)
8	1, 2, 3, 4, 5, 6, 7	isobs 22006	. . . . 5 ⊢ (𝐵 ∈ (OBasis‘𝑊) ↔ (𝑊 ∈ PreHil ∧ 𝐵 ⊆ 𝑉 ∧ (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 , 𝑦) = if(𝑥 = 𝑦, 1 , 0 ) ∧ ((ocv‘𝑊)‘𝐵) = {(0g‘𝑊)})))
9	8	simp3bi 1165	. . . 4 ⊢ (𝐵 ∈ (OBasis‘𝑊) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 , 𝑦) = if(𝑥 = 𝑦, 1 , 0 ) ∧ ((ocv‘𝑊)‘𝐵) = {(0g‘𝑊)}))
10	9	simpld 500	. . 3 ⊢ (𝐵 ∈ (OBasis‘𝑊) → ∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 , 𝑦) = if(𝑥 = 𝑦, 1 , 0 ))
11		oveq1 7419	. . . . 5 ⊢ (𝑥 = 𝑃 → (𝑥 , 𝑦) = (𝑃 , 𝑦))
12		eqeq1 2765	. . . . . 6 ⊢ (𝑥 = 𝑃 → (𝑥 = 𝑦 ↔ 𝑃 = 𝑦))
13	12	ifbid 4506	. . . . 5 ⊢ (𝑥 = 𝑃 → if(𝑥 = 𝑦, 1 , 0 ) = if(𝑃 = 𝑦, 1 , 0 ))
14	11, 13	eqeq12d 2777	. . . 4 ⊢ (𝑥 = 𝑃 → ((𝑥 , 𝑦) = if(𝑥 = 𝑦, 1 , 0 ) ↔ (𝑃 , 𝑦) = if(𝑃 = 𝑦, 1 , 0 )))
15		oveq2 7420	. . . . 5 ⊢ (𝑦 = 𝑄 → (𝑃 , 𝑦) = (𝑃 , 𝑄))
16		eqeq2 2773	. . . . . 6 ⊢ (𝑦 = 𝑄 → (𝑃 = 𝑦 ↔ 𝑃 = 𝑄))
17	16	ifbid 4506	. . . . 5 ⊢ (𝑦 = 𝑄 → if(𝑃 = 𝑦, 1 , 0 ) = if(𝑃 = 𝑄, 1 , 0 ))
18	15, 17	eqeq12d 2777	. . . 4 ⊢ (𝑦 = 𝑄 → ((𝑃 , 𝑦) = if(𝑃 = 𝑦, 1 , 0 ) ↔ (𝑃 , 𝑄) = if(𝑃 = 𝑄, 1 , 0 )))
19	14, 18	rspc2v 3587	. . 3 ⊢ ((𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (∀𝑥 ∈ 𝐵 ∀𝑦 ∈ 𝐵 (𝑥 , 𝑦) = if(𝑥 = 𝑦, 1 , 0 ) → (𝑃 , 𝑄) = if(𝑃 = 𝑄, 1 , 0 )))
20	10, 19	syl5com 32	. 2 ⊢ (𝐵 ∈ (OBasis‘𝑊) → ((𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 , 𝑄) = if(𝑃 = 𝑄, 1 , 0 )))
21	20	3impib 1134	1 ⊢ ((𝐵 ∈ (OBasis‘𝑊) ∧ 𝑃 ∈ 𝐵 ∧ 𝑄 ∈ 𝐵) → (𝑃 , 𝑄) = if(𝑃 = 𝑄, 1 , 0 ))

This proof depends on syntax axioms:   → wi 4   ∧ wa 401   ∧ w3a 1103   = wceq 1570   ∈ wcel 2145  ∀wral 3077   ⊆ wss 3899  ifcif 4482  {csn 4584  ‘cfv 6531  (class class class)co 7412  Basecbs 17367  Scalarcsca 17411  ·_𝑖cip 17413  0_gc0g 17590  1_rcur 20387  PreHilcphl 21910  ocvcocv 21946  OBasiscobs 21988

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

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 6487  df-fun 6533  df-fv 6539  df-ov 7415  df-obs 21991

This theorem is used by:  obsipid  22008  obselocv  22014