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

Theorem ipdiri 31087
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
StepHypRef Expression
1 oveq1 7407 . . . 4 (𝐴 = if(𝐴𝑋, 𝐴, (0vec𝑈)) → (𝐴𝐺𝐵) = (if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵))
21oveq1d 7415 . . 3 (𝐴 = if(𝐴𝑋, 𝐴, (0vec𝑈)) → ((𝐴𝐺𝐵)𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵)𝑃𝐶))
3 oveq1 7407 . . . 4 (𝐴 = if(𝐴𝑋, 𝐴, (0vec𝑈)) → (𝐴𝑃𝐶) = (if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶))
43oveq1d 7415 . . 3 (𝐴 = if(𝐴𝑋, 𝐴, (0vec𝑈)) → ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (𝐵𝑃𝐶)))
52, 4eqeq12d 2781 . 2 (𝐴 = if(𝐴𝑋, 𝐴, (0vec𝑈)) → (((𝐴𝐺𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)) ↔ ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (𝐵𝑃𝐶))))
6 oveq2 7408 . . . 4 (𝐵 = if(𝐵𝑋, 𝐵, (0vec𝑈)) → (if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵) = (if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈))))
76oveq1d 7415 . . 3 (𝐵 = if(𝐵𝑋, 𝐵, (0vec𝑈)) → ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈)))𝑃𝐶))
8 oveq1 7407 . . . 4 (𝐵 = if(𝐵𝑋, 𝐵, (0vec𝑈)) → (𝐵𝑃𝐶) = (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃𝐶))
98oveq2d 7416 . . 3 (𝐵 = if(𝐵𝑋, 𝐵, (0vec𝑈)) → ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (𝐵𝑃𝐶)) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃𝐶)))
107, 9eqeq12d 2781 . 2 (𝐵 = if(𝐵𝑋, 𝐵, (0vec𝑈)) → (((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺𝐵)𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (𝐵𝑃𝐶)) ↔ ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈)))𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃𝐶))))
11 oveq2 7408 . . 3 (𝐶 = if(𝐶𝑋, 𝐶, (0vec𝑈)) → ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈)))𝑃𝐶) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈)))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))))
12 oveq2 7408 . . . 4 (𝐶 = if(𝐶𝑋, 𝐶, (0vec𝑈)) → (if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) = (if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))))
13 oveq2 7408 . . . 4 (𝐶 = if(𝐶𝑋, 𝐶, (0vec𝑈)) → (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃𝐶) = (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))))
1412, 13oveq12d 7418 . . 3 (𝐶 = if(𝐶𝑋, 𝐶, (0vec𝑈)) → ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃𝐶) + (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃𝐶)) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))) + (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈)))))
1511, 14eqeq12d 2781 . 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 2765 . . . 4 (0vec𝑈) = (0vec𝑈)
2216, 21, 20elimph 31077 . . 3 if(𝐴𝑋, 𝐴, (0vec𝑈)) ∈ 𝑋
2316, 21, 20elimph 31077 . . 3 if(𝐵𝑋, 𝐵, (0vec𝑈)) ∈ 𝑋
2416, 21, 20elimph 31077 . . 3 if(𝐶𝑋, 𝐶, (0vec𝑈)) ∈ 𝑋
2516, 17, 18, 19, 20, 22, 23, 24ipdirilem 31086 . 2 ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝐺if(𝐵𝑋, 𝐵, (0vec𝑈)))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))) = ((if(𝐴𝑋, 𝐴, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))) + (if(𝐵𝑋, 𝐵, (0vec𝑈))𝑃if(𝐶𝑋, 𝐶, (0vec𝑈))))
265, 10, 15, 25dedth3h 4544 1 ((𝐴𝑋𝐵𝑋𝐶𝑋) → ((𝐴𝐺𝐵)𝑃𝐶) = ((𝐴𝑃𝐶) + (𝐵𝑃𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  w3a 1101   = wceq 1563  wcel 2145  ifcif 4483  cfv 6525  (class class class)co 7400   + caddc 11091   +𝑣 cpv 30842  BaseSetcba 30843   ·𝑠OLD cns 30844  0veccn0v 30845  ·𝑖OLDcdip 30957  CPreHilOLDccphlo 31069
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1818  ax-4 1832  ax-5 1933  ax-6 1990  ax-7 2031  ax-8 2147  ax-9 2155  ax-10 2178  ax-11 2194  ax-12 2215  ax-ext 2737  ax-rep 5231  ax-sep 5250  ax-nul 5260  ax-pow 5326  ax-pr 5394  ax-un 7722  ax-inf2 9598  ax-cnex 11144  ax-resscn 11145  ax-1cn 11146  ax-icn 11147  ax-addcl 11148  ax-addrcl 11149  ax-mulcl 11150  ax-mulrcl 11151  ax-mulcom 11152  ax-addass 11153  ax-mulass 11154  ax-distr 11155  ax-i2m1 11156  ax-1ne0 11157  ax-1rid 11158  ax-rnegex 11159  ax-rrecex 11160  ax-cnre 11161  ax-pre-lttri 11162  ax-pre-lttrn 11163  ax-pre-ltadd 11164  ax-pre-mulgt0 11165  ax-pre-sup 11166
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1102  df-3an 1103  df-tru 1566  df-fal 1576  df-ex 1803  df-nf 1807  df-sb 2094  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3370  df-reu 3371  df-rab 3418  df-v 3459  df-sbc 3748  df-csb 3856  df-dif 3910  df-un 3912  df-in 3914  df-ss 3924  df-pss 3927  df-nul 4289  df-if 4484  df-pw 4560  df-sn 4586  df-pr 4588  df-op 4592  df-uni 4868  df-int 4908  df-iun 4953  df-br 5105  df-opab 5167  df-mpt 5186  df-tr 5212  df-id 5546  df-eprel 5551  df-po 5559  df-so 5560  df-fr 5604  df-se 5605  df-we 5606  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-pred 6291  df-ord 6352  df-on 6353  df-lim 6354  df-suc 6355  df-iota 6481  df-fun 6527  df-fn 6528  df-f 6529  df-f1 6530  df-fo 6531  df-f1o 6532  df-fv 6533  df-isom 6534  df-riota 7357  df-ov 7403  df-oprab 7404  df-mpo 7405  df-om 7851  df-1st 7974  df-2nd 7975  df-frecs 8266  df-wrecs 8297  df-recs 8346  df-rdg 8385  df-1o 8441  df-er 8682  df-en 8932  df-dom 8933  df-sdom 8934  df-fin 8935  df-sup 9390  df-oi 9460  df-card 9913  df-pnf 11233  df-mnf 11234  df-xr 11235  df-ltxr 11236  df-le 11237  df-sub 11431  df-neg 11432  df-div 11860  df-nn 12222  df-2 12291  df-3 12292  df-4 12293  df-n0 12493  df-z 12580  df-uz 12851  df-rp 13005  df-fz 13524  df-fzo 13671  df-seq 14026  df-exp 14086  df-hash 14355  df-cj 15138  df-re 15139  df-im 15140  df-sqrt 15274  df-abs 15275  df-clim 15527  df-sum 15726  df-grpo 30750  df-gid 30751  df-ginv 30752  df-ablo 30802  df-vc 30816  df-nv 30849  df-va 30852  df-ba 30853  df-sm 30854  df-0v 30855  df-nmcv 30857  df-dip 30958  df-ph 31070
This theorem is referenced by:  ipasslem1  31088  ipasslem2  31089  ipasslem11  31097  dipdir  31099
  Copyright terms: Public domain W3C validator