HSE Home Hilbert Space Explorer < Previous   Next >
Nearby theorems
Mirrors  >  Home  >  HSE Home  >  Th. List  >  cdj3lem3b Structured version   Visualization version   GIF version

Theorem cdj3lem3b 32526
Description: Lemma for cdj3i 32527. The second-component function 𝑇 is bounded if the subspaces are completely disjoint. (Contributed by NM, 31-May-2005.) (New usage is discouraged.)
Hypotheses
Ref Expression
cdj3lem2.1 𝐴S
cdj3lem2.2 𝐵S
cdj3lem3.3 𝑇 = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
Assertion
Ref Expression
cdj3lem3b (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
Distinct variable groups:   𝑥,𝑦,𝑧,𝑤,𝑣,𝑢,𝐴   𝑥,𝐵,𝑦,𝑧,𝑤,𝑣,𝑢   𝑣,𝑇,𝑢
Allowed substitution hints:   𝑇(𝑥,𝑦,𝑧,𝑤)

Proof of Theorem cdj3lem3b
Dummy variables 𝑡 are mutually distinct and distinct from all other variables.
StepHypRef Expression
1 cdj3lem2.2 . . 3 𝐵S
2 cdj3lem2.1 . . 3 𝐴S
3 cdj3lem3.3 . . . 4 𝑇 = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
41, 2shscomi 31449 . . . . 5 (𝐵 + 𝐴) = (𝐴 + 𝐵)
51sheli 31300 . . . . . . . . 9 (𝑤𝐵𝑤 ∈ ℋ)
62sheli 31300 . . . . . . . . 9 (𝑧𝐴𝑧 ∈ ℋ)
7 ax-hvcom 31087 . . . . . . . . 9 ((𝑤 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
85, 6, 7syl2an 597 . . . . . . . 8 ((𝑤𝐵𝑧𝐴) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
98eqeq2d 2748 . . . . . . 7 ((𝑤𝐵𝑧𝐴) → (𝑥 = (𝑤 + 𝑧) ↔ 𝑥 = (𝑧 + 𝑤)))
109rexbidva 3160 . . . . . 6 (𝑤𝐵 → (∃𝑧𝐴 𝑥 = (𝑤 + 𝑧) ↔ ∃𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
1110riotabiia 7337 . . . . 5 (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)) = (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤))
124, 11mpteq12i 5183 . . . 4 (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧))) = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
133, 12eqtr4i 2763 . . 3 𝑇 = (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)))
141, 2, 13cdj3lem2b 32523 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
15 fveq2 6834 . . . . . . . 8 (𝑥 = 𝑡 → (norm𝑥) = (norm𝑡))
1615oveq1d 7375 . . . . . . 7 (𝑥 = 𝑡 → ((norm𝑥) + (norm𝑦)) = ((norm𝑡) + (norm𝑦)))
17 fvoveq1 7383 . . . . . . . 8 (𝑥 = 𝑡 → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑡 + 𝑦)))
1817oveq2d 7376 . . . . . . 7 (𝑥 = 𝑡 → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑡 + 𝑦))))
1916, 18breq12d 5099 . . . . . 6 (𝑥 = 𝑡 → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦)))))
20 fveq2 6834 . . . . . . . 8 (𝑦 = → (norm𝑦) = (norm))
2120oveq2d 7376 . . . . . . 7 (𝑦 = → ((norm𝑡) + (norm𝑦)) = ((norm𝑡) + (norm)))
22 oveq2 7368 . . . . . . . . 9 (𝑦 = → (𝑡 + 𝑦) = (𝑡 + ))
2322fveq2d 6838 . . . . . . . 8 (𝑦 = → (norm‘(𝑡 + 𝑦)) = (norm‘(𝑡 + )))
2423oveq2d 7376 . . . . . . 7 (𝑦 = → (𝑣 · (norm‘(𝑡 + 𝑦))) = (𝑣 · (norm‘(𝑡 + ))))
2521, 24breq12d 5099 . . . . . 6 (𝑦 = → (((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
2619, 25cbvral2vw 3220 . . . . 5 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
27 ralcom 3266 . . . . 5 (∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
281sheli 31300 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ ℋ)
29 normcl 31211 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (norm𝑥) ∈ ℝ)
3028, 29syl 17 . . . . . . . . . . 11 (𝑥𝐵 → (norm𝑥) ∈ ℝ)
3130recnd 11164 . . . . . . . . . 10 (𝑥𝐵 → (norm𝑥) ∈ ℂ)
322sheli 31300 . . . . . . . . . . . 12 (𝑦𝐴𝑦 ∈ ℋ)
33 normcl 31211 . . . . . . . . . . . 12 (𝑦 ∈ ℋ → (norm𝑦) ∈ ℝ)
3432, 33syl 17 . . . . . . . . . . 11 (𝑦𝐴 → (norm𝑦) ∈ ℝ)
3534recnd 11164 . . . . . . . . . 10 (𝑦𝐴 → (norm𝑦) ∈ ℂ)
36 addcom 11323 . . . . . . . . . 10 (((norm𝑥) ∈ ℂ ∧ (norm𝑦) ∈ ℂ) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
3731, 35, 36syl2an 597 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
38 ax-hvcom 31087 . . . . . . . . . . . 12 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3928, 32, 38syl2an 597 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐴) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
4039fveq2d 6838 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐴) → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑦 + 𝑥)))
4140oveq2d 7376 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑦 + 𝑥))))
4237, 41breq12d 5099 . . . . . . . 8 ((𝑥𝐵𝑦𝐴) → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4342ralbidva 3159 . . . . . . 7 (𝑥𝐵 → (∀𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4443ralbiia 3082 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))))
45 fveq2 6834 . . . . . . . . 9 (𝑥 = → (norm𝑥) = (norm))
4645oveq2d 7376 . . . . . . . 8 (𝑥 = → ((norm𝑦) + (norm𝑥)) = ((norm𝑦) + (norm)))
47 oveq2 7368 . . . . . . . . . 10 (𝑥 = → (𝑦 + 𝑥) = (𝑦 + ))
4847fveq2d 6838 . . . . . . . . 9 (𝑥 = → (norm‘(𝑦 + 𝑥)) = (norm‘(𝑦 + )))
4948oveq2d 7376 . . . . . . . 8 (𝑥 = → (𝑣 · (norm‘(𝑦 + 𝑥))) = (𝑣 · (norm‘(𝑦 + ))))
5046, 49breq12d 5099 . . . . . . 7 (𝑥 = → (((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + )))))
51 fveq2 6834 . . . . . . . . 9 (𝑦 = 𝑡 → (norm𝑦) = (norm𝑡))
5251oveq1d 7375 . . . . . . . 8 (𝑦 = 𝑡 → ((norm𝑦) + (norm)) = ((norm𝑡) + (norm)))
53 fvoveq1 7383 . . . . . . . . 9 (𝑦 = 𝑡 → (norm‘(𝑦 + )) = (norm‘(𝑡 + )))
5453oveq2d 7376 . . . . . . . 8 (𝑦 = 𝑡 → (𝑣 · (norm‘(𝑦 + ))) = (𝑣 · (norm‘(𝑡 + ))))
5552, 54breq12d 5099 . . . . . . 7 (𝑦 = 𝑡 → (((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + ))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
5650, 55cbvral2vw 3220 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
5744, 56bitr2i 276 . . . . 5 (∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5826, 27, 573bitri 297 . . . 4 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5958anbi2i 624 . . 3 ((0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
6059rexbii 3085 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
612, 1shscomi 31449 . . . . 5 (𝐴 + 𝐵) = (𝐵 + 𝐴)
6261raleqi 3294 . . . 4 (∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)) ↔ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)))
6362anbi2i 624 . . 3 ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6463rexbii 3085 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6514, 60, 643imtr4i 292 1 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 395   = wceq 1542  wcel 2114  wral 3052  wrex 3062   class class class wbr 5086  cmpt 5167  cfv 6492  crio 7316  (class class class)co 7360  cc 11027  cr 11028  0cc0 11029   + caddc 11032   · cmul 11034   < clt 11170  cle 11171  chba 31005   + cva 31006  normcno 31009   S csh 31014   + cph 31017
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1797  ax-4 1811  ax-5 1912  ax-6 1969  ax-7 2010  ax-8 2116  ax-9 2124  ax-10 2147  ax-11 2163  ax-12 2185  ax-ext 2709  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5302  ax-pr 5370  ax-un 7682  ax-cnex 11085  ax-resscn 11086  ax-1cn 11087  ax-icn 11088  ax-addcl 11089  ax-addrcl 11090  ax-mulcl 11091  ax-mulrcl 11092  ax-mulcom 11093  ax-addass 11094  ax-mulass 11095  ax-distr 11096  ax-i2m1 11097  ax-1ne0 11098  ax-1rid 11099  ax-rnegex 11100  ax-rrecex 11101  ax-cnre 11102  ax-pre-lttri 11103  ax-pre-lttrn 11104  ax-pre-ltadd 11105  ax-pre-mulgt0 11106  ax-pre-sup 11107  ax-hilex 31085  ax-hfvadd 31086  ax-hvcom 31087  ax-hvass 31088  ax-hv0cl 31089  ax-hvaddid 31090  ax-hfvmul 31091  ax-hvmulid 31092  ax-hvmulass 31093  ax-hvdistr1 31094  ax-hvdistr2 31095  ax-hvmul0 31096  ax-hfi 31165  ax-his1 31168  ax-his3 31170  ax-his4 31171
This theorem depends on definitions:  df-bi 207  df-an 396  df-or 849  df-3or 1088  df-3an 1089  df-tru 1545  df-fal 1555  df-ex 1782  df-nf 1786  df-sb 2069  df-mo 2540  df-eu 2570  df-clab 2716  df-cleq 2729  df-clel 2812  df-nfc 2886  df-ne 2934  df-nel 3038  df-ral 3053  df-rex 3063  df-rmo 3343  df-reu 3344  df-rab 3391  df-v 3432  df-sbc 3730  df-csb 3839  df-dif 3893  df-un 3895  df-in 3897  df-ss 3907  df-pss 3910  df-nul 4275  df-if 4468  df-pw 4544  df-sn 4569  df-pr 4571  df-op 4575  df-uni 4852  df-int 4891  df-iun 4936  df-br 5087  df-opab 5149  df-mpt 5168  df-tr 5194  df-id 5519  df-eprel 5524  df-po 5532  df-so 5533  df-fr 5577  df-we 5579  df-xp 5630  df-rel 5631  df-cnv 5632  df-co 5633  df-dm 5634  df-rn 5635  df-res 5636  df-ima 5637  df-pred 6259  df-ord 6320  df-on 6321  df-lim 6322  df-suc 6323  df-iota 6448  df-fun 6494  df-fn 6495  df-f 6496  df-f1 6497  df-fo 6498  df-f1o 6499  df-fv 6500  df-riota 7317  df-ov 7363  df-oprab 7364  df-mpo 7365  df-om 7811  df-2nd 7936  df-frecs 8224  df-wrecs 8255  df-recs 8304  df-rdg 8342  df-er 8636  df-en 8887  df-dom 8888  df-sdom 8889  df-sup 9348  df-pnf 11172  df-mnf 11173  df-xr 11174  df-ltxr 11175  df-le 11176  df-sub 11370  df-neg 11371  df-div 11799  df-nn 12166  df-2 12235  df-3 12236  df-n0 12429  df-z 12516  df-uz 12780  df-rp 12934  df-seq 13955  df-exp 14015  df-cj 15052  df-re 15053  df-im 15054  df-sqrt 15188  df-abs 15189  df-grpo 30579  df-ablo 30631  df-hnorm 31054  df-hvsub 31057  df-sh 31293  df-ch0 31339  df-shs 31394
This theorem is referenced by:  cdj3i  32527
  Copyright terms: Public domain W3C validator