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

Theorem lnolin 31106
Description: Basic linearity property of a linear operator. (Contributed by NM, 4-Dec-2007.) (Revised by Mario Carneiro, 16-Nov-2013.) (New usage is discouraged.)
Hypotheses
Ref Expression
lnoval.1 𝑋 = (BaseSet‘𝑈)
lnoval.2 𝑌 = (BaseSet‘𝑊)
lnoval.3 𝐺 = ( +𝑣𝑈)
lnoval.4 𝐻 = ( +𝑣𝑊)
lnoval.5 𝑅 = ( ·𝑠OLD𝑈)
lnoval.6 𝑆 = ( ·𝑠OLD𝑊)
lnoval.7 𝐿 = (𝑈 LnOp 𝑊)
Assertion
Ref Expression
lnolin (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇𝐿) ∧ (𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝐶)))

Proof of Theorem lnolin
Dummy variables 𝑢 𝑡 𝑤 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 lnoval.1 . . . . 5 𝑋 = (BaseSet‘𝑈)
2 lnoval.2 . . . . 5 𝑌 = (BaseSet‘𝑊)
3 lnoval.3 . . . . 5 𝐺 = ( +𝑣𝑈)
4 lnoval.4 . . . . 5 𝐻 = ( +𝑣𝑊)
5 lnoval.5 . . . . 5 𝑅 = ( ·𝑠OLD𝑈)
6 lnoval.6 . . . . 5 𝑆 = ( ·𝑠OLD𝑊)
7 lnoval.7 . . . . 5 𝐿 = (𝑈 LnOp 𝑊)
81, 2, 3, 4, 5, 6, 7islno 31105 . . . 4 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇𝐿 ↔ (𝑇:𝑋𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤𝑋𝑡𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡)))))
98biimp3a 1498 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇𝐿) → (𝑇:𝑋𝑌 ∧ ∀𝑢 ∈ ℂ ∀𝑤𝑋𝑡𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡))))
109simprd 500 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇𝐿) → ∀𝑢 ∈ ℂ ∀𝑤𝑋𝑡𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡)))
11 oveq1 7417 . . . . 5 (𝑢 = 𝐴 → (𝑢𝑅𝑤) = (𝐴𝑅𝑤))
1211fvoveq1d 7432 . . . 4 (𝑢 = 𝐴 → (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)))
13 oveq1 7417 . . . . 5 (𝑢 = 𝐴 → (𝑢𝑆(𝑇𝑤)) = (𝐴𝑆(𝑇𝑤)))
1413oveq1d 7425 . . . 4 (𝑢 = 𝐴 → ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡)) = ((𝐴𝑆(𝑇𝑤))𝐻(𝑇𝑡)))
1512, 14eqeq12d 2779 . . 3 (𝑢 = 𝐴 → ((𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡)) ↔ (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇𝑤))𝐻(𝑇𝑡))))
16 oveq2 7418 . . . . 5 (𝑤 = 𝐵 → (𝐴𝑅𝑤) = (𝐴𝑅𝐵))
1716fvoveq1d 7432 . . . 4 (𝑤 = 𝐵 → (𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)))
18 fveq2 6881 . . . . . 6 (𝑤 = 𝐵 → (𝑇𝑤) = (𝑇𝐵))
1918oveq2d 7426 . . . . 5 (𝑤 = 𝐵 → (𝐴𝑆(𝑇𝑤)) = (𝐴𝑆(𝑇𝐵)))
2019oveq1d 7425 . . . 4 (𝑤 = 𝐵 → ((𝐴𝑆(𝑇𝑤))𝐻(𝑇𝑡)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝑡)))
2117, 20eqeq12d 2779 . . 3 (𝑤 = 𝐵 → ((𝑇‘((𝐴𝑅𝑤)𝐺𝑡)) = ((𝐴𝑆(𝑇𝑤))𝐻(𝑇𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝑡))))
22 oveq2 7418 . . . . 5 (𝑡 = 𝐶 → ((𝐴𝑅𝐵)𝐺𝑡) = ((𝐴𝑅𝐵)𝐺𝐶))
2322fveq2d 6885 . . . 4 (𝑡 = 𝐶 → (𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)))
24 fveq2 6881 . . . . 5 (𝑡 = 𝐶 → (𝑇𝑡) = (𝑇𝐶))
2524oveq2d 7426 . . . 4 (𝑡 = 𝐶 → ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝑡)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝐶)))
2623, 25eqeq12d 2779 . . 3 (𝑡 = 𝐶 → ((𝑇‘((𝐴𝑅𝐵)𝐺𝑡)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝑡)) ↔ (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝐶))))
2715, 21, 26rspc3v 3597 . 2 ((𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋) → (∀𝑢 ∈ ℂ ∀𝑤𝑋𝑡𝑋 (𝑇‘((𝑢𝑅𝑤)𝐺𝑡)) = ((𝑢𝑆(𝑇𝑤))𝐻(𝑇𝑡)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝐶))))
2810, 27mpan9 515 1 (((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec ∧ 𝑇𝐿) ∧ (𝐴 ∈ ℂ ∧ 𝐵𝑋𝐶𝑋)) → (𝑇‘((𝐴𝑅𝐵)𝐺𝐶)) = ((𝐴𝑆(𝑇𝐵))𝐻(𝑇𝐶)))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400  w3a 1103   = wceq 1570  wcel 2143  wral 3079  wf 6532  cfv 6536  (class class class)co 7410  cc 11093  NrmCVeccnv 30936   +𝑣 cpv 30937  BaseSetcba 30938   ·𝑠OLD cns 30939   LnOp clno 31092
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1825  ax-4 1839  ax-5 1940  ax-6 1997  ax-7 2038  ax-8 2145  ax-9 2153  ax-10 2176  ax-11 2192  ax-12 2213  ax-ext 2735  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1810  df-nf 1814  df-sb 2097  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2838  df-nfc 2912  df-ne 2959  df-ral 3080  df-rex 3090  df-rab 3417  df-v 3457  df-sbc 3745  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-br 5110  df-opab 5174  df-id 5556  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-fv 6544  df-ov 7413  df-oprab 7414  df-mpo 7415  df-map 8822  df-lno 31096
This theorem is referenced by:  lno0  31108  lnocoi  31109  lnoadd  31110  lnosub  31111  lnomul  31112
  Copyright terms: Public domain W3C validator