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

Theorem cdj3lem3b 32792
Description: Lemma for cdj3i 32793. 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 31715 . . . . 5 (𝐵 + 𝐴) = (𝐴 + 𝐵)
51sheli 31566 . . . . . . . . 9 (𝑤𝐵𝑤 ∈ ℋ)
62sheli 31566 . . . . . . . . 9 (𝑧𝐴𝑧 ∈ ℋ)
7 ax-hvcom 31353 . . . . . . . . 9 ((𝑤 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
85, 6, 7syl2an 607 . . . . . . . 8 ((𝑤𝐵𝑧𝐴) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
98eqeq2d 2774 . . . . . . 7 ((𝑤𝐵𝑧𝐴) → (𝑥 = (𝑤 + 𝑧) ↔ 𝑥 = (𝑧 + 𝑤)))
109rexbidva 3187 . . . . . 6 (𝑤𝐵 → (∃𝑧𝐴 𝑥 = (𝑤 + 𝑧) ↔ ∃𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
1110riotabiia 7387 . . . . 5 (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)) = (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤))
124, 11mpteq12i 5208 . . . 4 (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧))) = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
133, 12eqtr4i 2789 . . 3 𝑇 = (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)))
141, 2, 13cdj3lem2b 32789 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
15 fveq2 6881 . . . . . . . 8 (𝑥 = 𝑡 → (norm𝑥) = (norm𝑡))
1615oveq1d 7425 . . . . . . 7 (𝑥 = 𝑡 → ((norm𝑥) + (norm𝑦)) = ((norm𝑡) + (norm𝑦)))
17 fvoveq1 7433 . . . . . . . 8 (𝑥 = 𝑡 → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑡 + 𝑦)))
1817oveq2d 7426 . . . . . . 7 (𝑥 = 𝑡 → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑡 + 𝑦))))
1916, 18breq12d 5122 . . . . . 6 (𝑥 = 𝑡 → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦)))))
20 fveq2 6881 . . . . . . . 8 (𝑦 = → (norm𝑦) = (norm))
2120oveq2d 7426 . . . . . . 7 (𝑦 = → ((norm𝑡) + (norm𝑦)) = ((norm𝑡) + (norm)))
22 oveq2 7418 . . . . . . . . 9 (𝑦 = → (𝑡 + 𝑦) = (𝑡 + ))
2322fveq2d 6885 . . . . . . . 8 (𝑦 = → (norm‘(𝑡 + 𝑦)) = (norm‘(𝑡 + )))
2423oveq2d 7426 . . . . . . 7 (𝑦 = → (𝑣 · (norm‘(𝑡 + 𝑦))) = (𝑣 · (norm‘(𝑡 + ))))
2521, 24breq12d 5122 . . . . . 6 (𝑦 = → (((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
2619, 25cbvral2vw 3247 . . . . 5 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
27 ralcom 3293 . . . . 5 (∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
281sheli 31566 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ ℋ)
29 normcl 31477 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (norm𝑥) ∈ ℝ)
3028, 29syl 18 . . . . . . . . . . 11 (𝑥𝐵 → (norm𝑥) ∈ ℝ)
3130recnd 11232 . . . . . . . . . 10 (𝑥𝐵 → (norm𝑥) ∈ ℂ)
322sheli 31566 . . . . . . . . . . . 12 (𝑦𝐴𝑦 ∈ ℋ)
33 normcl 31477 . . . . . . . . . . . 12 (𝑦 ∈ ℋ → (norm𝑦) ∈ ℝ)
3432, 33syl 18 . . . . . . . . . . 11 (𝑦𝐴 → (norm𝑦) ∈ ℝ)
3534recnd 11232 . . . . . . . . . 10 (𝑦𝐴 → (norm𝑦) ∈ ℂ)
36 addcom 11391 . . . . . . . . . 10 (((norm𝑥) ∈ ℂ ∧ (norm𝑦) ∈ ℂ) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
3731, 35, 36syl2an 607 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
38 ax-hvcom 31353 . . . . . . . . . . . 12 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3928, 32, 38syl2an 607 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐴) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
4039fveq2d 6885 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐴) → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑦 + 𝑥)))
4140oveq2d 7426 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑦 + 𝑥))))
4237, 41breq12d 5122 . . . . . . . 8 ((𝑥𝐵𝑦𝐴) → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4342ralbidva 3186 . . . . . . 7 (𝑥𝐵 → (∀𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4443ralbiia 3109 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))))
45 fveq2 6881 . . . . . . . . 9 (𝑥 = → (norm𝑥) = (norm))
4645oveq2d 7426 . . . . . . . 8 (𝑥 = → ((norm𝑦) + (norm𝑥)) = ((norm𝑦) + (norm)))
47 oveq2 7418 . . . . . . . . . 10 (𝑥 = → (𝑦 + 𝑥) = (𝑦 + ))
4847fveq2d 6885 . . . . . . . . 9 (𝑥 = → (norm‘(𝑦 + 𝑥)) = (norm‘(𝑦 + )))
4948oveq2d 7426 . . . . . . . 8 (𝑥 = → (𝑣 · (norm‘(𝑦 + 𝑥))) = (𝑣 · (norm‘(𝑦 + ))))
5046, 49breq12d 5122 . . . . . . 7 (𝑥 = → (((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + )))))
51 fveq2 6881 . . . . . . . . 9 (𝑦 = 𝑡 → (norm𝑦) = (norm𝑡))
5251oveq1d 7425 . . . . . . . 8 (𝑦 = 𝑡 → ((norm𝑦) + (norm)) = ((norm𝑡) + (norm)))
53 fvoveq1 7433 . . . . . . . . 9 (𝑦 = 𝑡 → (norm‘(𝑦 + )) = (norm‘(𝑡 + )))
5453oveq2d 7426 . . . . . . . 8 (𝑦 = 𝑡 → (𝑣 · (norm‘(𝑦 + ))) = (𝑣 · (norm‘(𝑡 + ))))
5552, 54breq12d 5122 . . . . . . 7 (𝑦 = 𝑡 → (((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + ))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
5650, 55cbvral2vw 3247 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
5744, 56bitr2i 279 . . . . 5 (∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5826, 27, 573bitri 300 . . . 4 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5958anbi2i 634 . . 3 ((0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
6059rexbii 3112 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
612, 1shscomi 31715 . . . . 5 (𝐴 + 𝐵) = (𝐵 + 𝐴)
6261raleqi 3321 . . . 4 (∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)) ↔ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)))
6362anbi2i 634 . . 3 ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6463rexbii 3112 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6514, 60, 643imtr4i 295 1 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 400   = wceq 1570  wcel 2143  wral 3079  wrex 3089   class class class wbr 5109  cmpt 5192  cfv 6536  crio 7366  (class class class)co 7410  cc 11093  cr 11094  0cc0 11095   + caddc 11098   · cmul 11100   < clt 11238  cle 11239  chba 31271   + cva 31272  normcno 31275   S csh 31280   + cph 31283
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-rep 5238  ax-sep 5257  ax-nul 5269  ax-pow 5336  ax-pr 5404  ax-un 7732  ax-cnex 11151  ax-resscn 11152  ax-1cn 11153  ax-icn 11154  ax-addcl 11155  ax-addrcl 11156  ax-mulcl 11157  ax-mulrcl 11158  ax-mulcom 11159  ax-addass 11160  ax-mulass 11161  ax-distr 11162  ax-i2m1 11163  ax-1ne0 11164  ax-1rid 11165  ax-rnegex 11166  ax-rrecex 11167  ax-cnre 11168  ax-pre-lttri 11169  ax-pre-lttrn 11170  ax-pre-ltadd 11171  ax-pre-mulgt0 11172  ax-pre-sup 11173  ax-hilex 31351  ax-hfvadd 31352  ax-hvcom 31353  ax-hvass 31354  ax-hv0cl 31355  ax-hvaddid 31356  ax-hfvmul 31357  ax-hvmulid 31358  ax-hvmulass 31359  ax-hvdistr1 31360  ax-hvdistr2 31361  ax-hvmul0 31362  ax-hfi 31431  ax-his1 31434  ax-his3 31436  ax-his4 31437
This theorem depends on definitions:  df-bi 210  df-an 401  df-or 861  df-3or 1104  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-nel 3065  df-ral 3080  df-rex 3090  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3457  df-sbc 3745  df-csb 3854  df-dif 3908  df-un 3910  df-in 3912  df-ss 3922  df-pss 3925  df-nul 4287  df-if 4488  df-pw 4564  df-sn 4590  df-pr 4592  df-op 4596  df-uni 4873  df-int 4913  df-iun 4958  df-br 5110  df-opab 5174  df-mpt 5193  df-tr 5219  df-id 5556  df-eprel 5561  df-po 5569  df-so 5570  df-fr 5614  df-we 5616  df-xp 5667  df-rel 5668  df-cnv 5669  df-co 5670  df-dm 5671  df-rn 5672  df-res 5673  df-ima 5674  df-pred 6302  df-ord 6363  df-on 6364  df-lim 6365  df-suc 6366  df-iota 6492  df-fun 6538  df-fn 6539  df-f 6540  df-f1 6541  df-fo 6542  df-f1o 6543  df-fv 6544  df-riota 7367  df-ov 7413  df-oprab 7414  df-mpo 7415  df-om 7859  df-2nd 7983  df-frecs 8274  df-wrecs 8305  df-recs 8354  df-rdg 8393  df-er 8690  df-en 8940  df-dom 8941  df-sdom 8942  df-sup 9398  df-pnf 11240  df-mnf 11241  df-xr 11242  df-ltxr 11243  df-le 11244  df-sub 11438  df-neg 11439  df-div 11867  df-nn 12229  df-2 12298  df-3 12299  df-n0 12500  df-z 12587  df-uz 12858  df-rp 13012  df-seq 14034  df-exp 14094  df-cj 15146  df-re 15147  df-im 15148  df-sqrt 15282  df-abs 15283  df-grpo 30845  df-ablo 30897  df-hnorm 31320  df-hvsub 31323  df-sh 31559  df-ch0 31605  df-shs 31660
This theorem is referenced by:  cdj3i  32793
  Copyright terms: Public domain W3C validator