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

Theorem islno 28532
Description: The predicate "is 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
islno ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇𝐿 ↔ (𝑇:𝑋𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧)))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑈   𝑥,𝑊,𝑦,𝑧   𝑦,𝑋,𝑧   𝑥,𝑇,𝑦,𝑧
Allowed substitution hints:   𝑅(𝑥,𝑦,𝑧)   𝑆(𝑥,𝑦,𝑧)   𝐺(𝑥,𝑦,𝑧)   𝐻(𝑥,𝑦,𝑧)   𝐿(𝑥,𝑦,𝑧)   𝑋(𝑥)   𝑌(𝑥,𝑦,𝑧)

Proof of Theorem islno
Dummy variable 𝑤 is distinct from all other variables.
StepHypRef Expression
1 lnoval.1 . . . 4 𝑋 = (BaseSet‘𝑈)
2 lnoval.2 . . . 4 𝑌 = (BaseSet‘𝑊)
3 lnoval.3 . . . 4 𝐺 = ( +𝑣𝑈)
4 lnoval.4 . . . 4 𝐻 = ( +𝑣𝑊)
5 lnoval.5 . . . 4 𝑅 = ( ·𝑠OLD𝑈)
6 lnoval.6 . . . 4 𝑆 = ( ·𝑠OLD𝑊)
7 lnoval.7 . . . 4 𝐿 = (𝑈 LnOp 𝑊)
81, 2, 3, 4, 5, 6, 7lnoval 28531 . . 3 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → 𝐿 = {𝑤 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧))})
98eleq2d 2900 . 2 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇𝐿𝑇 ∈ {𝑤 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧))}))
10 fveq1 6671 . . . . . . 7 (𝑤 = 𝑇 → (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)))
11 fveq1 6671 . . . . . . . . 9 (𝑤 = 𝑇 → (𝑤𝑦) = (𝑇𝑦))
1211oveq2d 7174 . . . . . . . 8 (𝑤 = 𝑇 → (𝑥𝑆(𝑤𝑦)) = (𝑥𝑆(𝑇𝑦)))
13 fveq1 6671 . . . . . . . 8 (𝑤 = 𝑇 → (𝑤𝑧) = (𝑇𝑧))
1412, 13oveq12d 7176 . . . . . . 7 (𝑤 = 𝑇 → ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧)))
1510, 14eqeq12d 2839 . . . . . 6 (𝑤 = 𝑇 → ((𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧)) ↔ (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
16152ralbidv 3201 . . . . 5 (𝑤 = 𝑇 → (∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧)) ↔ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
1716ralbidv 3199 . . . 4 (𝑤 = 𝑇 → (∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧)) ↔ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
1817elrab 3682 . . 3 (𝑇 ∈ {𝑤 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧))} ↔ (𝑇 ∈ (𝑌m 𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
192fvexi 6686 . . . . 5 𝑌 ∈ V
201fvexi 6686 . . . . 5 𝑋 ∈ V
2119, 20elmap 8437 . . . 4 (𝑇 ∈ (𝑌m 𝑋) ↔ 𝑇:𝑋𝑌)
2221anbi1i 625 . . 3 ((𝑇 ∈ (𝑌m 𝑋) ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))) ↔ (𝑇:𝑋𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
2318, 22bitri 277 . 2 (𝑇 ∈ {𝑤 ∈ (𝑌m 𝑋) ∣ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑤‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑤𝑦))𝐻(𝑤𝑧))} ↔ (𝑇:𝑋𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧))))
249, 23syl6bb 289 1 ((𝑈 ∈ NrmCVec ∧ 𝑊 ∈ NrmCVec) → (𝑇𝐿 ↔ (𝑇:𝑋𝑌 ∧ ∀𝑥 ∈ ℂ ∀𝑦𝑋𝑧𝑋 (𝑇‘((𝑥𝑅𝑦)𝐺𝑧)) = ((𝑥𝑆(𝑇𝑦))𝐻(𝑇𝑧)))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wb 208  wa 398   = wceq 1537  wcel 2114  wral 3140  {crab 3144  wf 6353  cfv 6357  (class class class)co 7158  m cmap 8408  cc 10537  NrmCVeccnv 28363   +𝑣 cpv 28364  BaseSetcba 28365   ·𝑠OLD cns 28366   LnOp clno 28519
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1796  ax-4 1810  ax-5 1911  ax-6 1970  ax-7 2015  ax-8 2116  ax-9 2124  ax-10 2145  ax-11 2161  ax-12 2177  ax-ext 2795  ax-sep 5205  ax-nul 5212  ax-pow 5268  ax-pr 5332  ax-un 7463
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3an 1085  df-tru 1540  df-ex 1781  df-nf 1785  df-sb 2070  df-mo 2622  df-eu 2654  df-clab 2802  df-cleq 2816  df-clel 2895  df-nfc 2965  df-ral 3145  df-rex 3146  df-rab 3149  df-v 3498  df-sbc 3775  df-dif 3941  df-un 3943  df-in 3945  df-ss 3954  df-nul 4294  df-if 4470  df-pw 4543  df-sn 4570  df-pr 4572  df-op 4576  df-uni 4841  df-br 5069  df-opab 5131  df-id 5462  df-xp 5563  df-rel 5564  df-cnv 5565  df-co 5566  df-dm 5567  df-rn 5568  df-iota 6316  df-fun 6359  df-fn 6360  df-f 6361  df-fv 6365  df-ov 7161  df-oprab 7162  df-mpo 7163  df-map 8410  df-lno 28523
This theorem is referenced by:  lnolin  28533  lnof  28534  lnocoi  28536  0lno  28569  ipblnfi  28634
  Copyright terms: Public domain W3C validator