Theorem ipdiri 31219

Description: Distributive law for inner product. Equation I3 of [Ponnusamy] p. 362. (Contributed by NM, 27-Apr-2007.) (New usage is discouraged.)

Hypotheses

Ref	Expression
ip1i.1	⊢ 𝑋 = (BaseSet‘𝑈)
ip1i.2	⊢ 𝐺 = ( +𝑣 ‘𝑈)
ip1i.4	⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
ip1i.7	⊢ 𝑃 = (·𝑖OLD‘𝑈)
ip1i.9	⊢ 𝑈 ∈ CPreHilOLD

Assertion

Ref	Expression
ipdiri	⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)))

Proof of Theorem ipdiri

Step	Hyp	Ref	Expression
1		oveq1 7430	. . . 4 ⊢ (𝐴 = if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) → (𝐴𝐺𝐵) = (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵))
2	1	oveq1d 7438	. . 3 ⊢ (𝐴 = if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) → ((𝐴𝐺𝐵)𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵)𝑃𝐶))
3		oveq1 7430	. . . 4 ⊢ (𝐴 = if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) → (𝐴𝑃𝐶) = (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶))
4	3	oveq1d 7438	. . 3 ⊢ (𝐴 = if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) → ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (𝐵𝑃𝐶)))
5	2, 4	eqeq12d 2782	. 2 ⊢ (𝐴 = if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) → (((𝐴𝐺𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)) ↔ ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (𝐵𝑃𝐶))))
6		oveq2 7431	. . . 4 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵) = (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))))
7	6	oveq1d 7438	. . 3 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶))
8		oveq1 7430	. . . 4 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (𝐵𝑃𝐶) = (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶))
9	8	oveq2d 7439	. . 3 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (𝐵𝑃𝐶)) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)))
10	7, 9	eqeq12d 2782	. 2 ⊢ (𝐵 = if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) → (((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (𝐵𝑃𝐶)) ↔ ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶))))
11		oveq2 7431	. . 3 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))
12		oveq2 7431	. . . 4 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) = (if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))
13		oveq2 7431	. . . 4 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶) = (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))
14	12, 13	oveq12d 7441	. . 3 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)))))
15	11, 14	eqeq12d 2782	. 2 ⊢ (𝐶 = if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) → (((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃𝐶) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃𝐶) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃𝐶)) ↔ ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))))
16		ip1i.1	. . 3 ⊢ 𝑋 = (BaseSet‘𝑈)
17		ip1i.2	. . 3 ⊢ 𝐺 = ( +𝑣 ‘𝑈)
18		ip1i.4	. . 3 ⊢ 𝑆 = ( ·𝑠OLD ‘𝑈)
19		ip1i.7	. . 3 ⊢ 𝑃 = (·𝑖OLD‘𝑈)
20		ip1i.9	. . 3 ⊢ 𝑈 ∈ CPreHilOLD
21		eqid 2766	. . . 4 ⊢ (0vec‘𝑈) = (0vec‘𝑈)
22	16, 21, 20	elimph 31209	. . 3 ⊢ if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈)) ∈ 𝑋
23	16, 21, 20	elimph 31209	. . 3 ⊢ if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)) ∈ 𝑋
24	16, 21, 20	elimph 31209	. . 3 ⊢ if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈)) ∈ 𝑋
25	16, 17, 18, 19, 20, 22, 23, 24	ipdirilem 31218	. 2 ⊢ ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝐺if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈)))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) = ((if(𝐴 ∈ 𝑋, 𝐴, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))) + (if(𝐵 ∈ 𝑋, 𝐵, (0vec‘𝑈))𝑃if(𝐶 ∈ 𝑋, 𝐶, (0vec‘𝑈))))
26	5, 10, 15, 25	dedth3h 4553	1 ⊢ ((𝐴 ∈ 𝑋 ∧ 𝐵 ∈ 𝑋 ∧ 𝐶 ∈ 𝑋) → ((𝐴𝐺𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)))

This proof depends on syntax axioms:   → wi 4   ∧ w3a 1103   = wceq 1570   ∈ wcel 2146  ifcif 4492  ‘cfv 6543  (class class class)co 7423   + caddc 11121   +_𝑣 cpv 30974  BaseSetcba 30975   ·_𝑠OLD cns 30976  0_veccn0v 30977  ·_𝑖OLDcdip 31089  CPreHil_OLDccphlo 31201

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 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2738  ax-rep 5243  ax-sep 5262  ax-nul 5274  ax-pow 5341  ax-pr 5409  ax-un 7745  ax-inf2 9620  ax-cnex 11174  ax-resscn 11175  ax-1cn 11176  ax-icn 11177  ax-addcl 11178  ax-addrcl 11179  ax-mulcl 11180  ax-mulrcl 11181  ax-mulcom 11182  ax-addass 11183  ax-mulass 11184  ax-distr 11185  ax-i2m1 11186  ax-1ne0 11187  ax-1rid 11188  ax-rnegex 11189  ax-rrecex 11190  ax-cnre 11191  ax-pre-lttri 11192  ax-pre-lttrn 11193  ax-pre-ltadd 11194  ax-pre-mulgt0 11195  ax-pre-sup 11196

This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2570  df-eu 2600  df-clab 2745  df-cleq 2758  df-clel 2841  df-nfc 2915  df-ne 2962  df-nel 3068  df-ral 3083  df-rex 3093  df-rmo 3372  df-reu 3373  df-rab 3420  df-v 3460  df-sbc 3748  df-csb 3857  df-dif 3911  df-un 3913  df-in 3915  df-ss 3925  df-pss 3928  df-nul 4290  df-if 4493  df-pw 4569  df-sn 4595  df-pr 4597  df-op 4601  df-uni 4878  df-int 4918  df-iun 4963  df-br 5115  df-opab 5179  df-mpt 5198  df-tr 5224  df-id 5561  df-eprel 5566  df-po 5574  df-so 5575  df-fr 5619  df-se 5620  df-we 5621  df-xp 5672  df-rel 5673  df-cnv 5674  df-co 5675  df-dm 5676  df-rn 5677  df-res 5678  df-ima 5679  df-pred 6309  df-ord 6370  df-on 6371  df-lim 6372  df-suc 6373  df-iota 6499  df-fun 6545  df-fn 6546  df-f 6547  df-f1 6548  df-fo 6549  df-f1o 6550  df-fv 6551  df-isom 6552  df-riota 7380  df-ov 7426  df-oprab 7427  df-mpo 7428  df-om 7872  df-1st 7995  df-2nd 7996  df-frecs 8287  df-wrecs 8318  df-recs 8367  df-rdg 8406  df-1o 8462  df-er 8703  df-en 8953  df-dom 8954  df-sdom 8955  df-fin 8956  df-sup 9412  df-oi 9482  df-card 9944  df-pnf 11263  df-mnf 11264  df-xr 11265  df-ltxr 11266  df-le 11267  df-sub 11461  df-neg 11462  df-div 11890  df-nn 12252  df-2 12321  df-3 12322  df-4 12323  df-n0 12523  df-z 12610  df-uz 12881  df-rp 13035  df-fz 13554  df-fzo 13702  df-seq 14058  df-exp 14118  df-hash 14387  df-cj 15176  df-re 15177  df-im 15178  df-sqrt 15312  df-abs 15313  df-clim 15565  df-sum 15764  df-grpo 30882  df-gid 30883  df-ginv 30884  df-ablo 30934  df-vc 30948  df-nv 30981  df-va 30984  df-ba 30985  df-sm 30986  df-0v 30987  df-nmcv 30989  df-dip 31090  df-ph 31202

This theorem is used by:  ipasslem1  31220  ipasslem2  31221  ipasslem11  31229  dipdir  31231