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

Theorem cdj3lem3b 32511
Description: Lemma for cdj3i 32512. 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 31434 . . . . 5 (𝐵 + 𝐴) = (𝐴 + 𝐵)
51sheli 31285 . . . . . . . . 9 (𝑤𝐵𝑤 ∈ ℋ)
62sheli 31285 . . . . . . . . 9 (𝑧𝐴𝑧 ∈ ℋ)
7 ax-hvcom 31072 . . . . . . . . 9 ((𝑤 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
85, 6, 7syl2an 597 . . . . . . . 8 ((𝑤𝐵𝑧𝐴) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
98eqeq2d 2747 . . . . . . 7 ((𝑤𝐵𝑧𝐴) → (𝑥 = (𝑤 + 𝑧) ↔ 𝑥 = (𝑧 + 𝑤)))
109rexbidva 3159 . . . . . 6 (𝑤𝐵 → (∃𝑧𝐴 𝑥 = (𝑤 + 𝑧) ↔ ∃𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
1110riotabiia 7344 . . . . 5 (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)) = (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤))
124, 11mpteq12i 5182 . . . 4 (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧))) = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
133, 12eqtr4i 2762 . . 3 𝑇 = (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)))
141, 2, 13cdj3lem2b 32508 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
15 fveq2 6840 . . . . . . . 8 (𝑥 = 𝑡 → (norm𝑥) = (norm𝑡))
1615oveq1d 7382 . . . . . . 7 (𝑥 = 𝑡 → ((norm𝑥) + (norm𝑦)) = ((norm𝑡) + (norm𝑦)))
17 fvoveq1 7390 . . . . . . . 8 (𝑥 = 𝑡 → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑡 + 𝑦)))
1817oveq2d 7383 . . . . . . 7 (𝑥 = 𝑡 → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑡 + 𝑦))))
1916, 18breq12d 5098 . . . . . 6 (𝑥 = 𝑡 → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦)))))
20 fveq2 6840 . . . . . . . 8 (𝑦 = → (norm𝑦) = (norm))
2120oveq2d 7383 . . . . . . 7 (𝑦 = → ((norm𝑡) + (norm𝑦)) = ((norm𝑡) + (norm)))
22 oveq2 7375 . . . . . . . . 9 (𝑦 = → (𝑡 + 𝑦) = (𝑡 + ))
2322fveq2d 6844 . . . . . . . 8 (𝑦 = → (norm‘(𝑡 + 𝑦)) = (norm‘(𝑡 + )))
2423oveq2d 7383 . . . . . . 7 (𝑦 = → (𝑣 · (norm‘(𝑡 + 𝑦))) = (𝑣 · (norm‘(𝑡 + ))))
2521, 24breq12d 5098 . . . . . 6 (𝑦 = → (((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
2619, 25cbvral2vw 3219 . . . . 5 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
27 ralcom 3265 . . . . 5 (∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
281sheli 31285 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ ℋ)
29 normcl 31196 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (norm𝑥) ∈ ℝ)
3028, 29syl 17 . . . . . . . . . . 11 (𝑥𝐵 → (norm𝑥) ∈ ℝ)
3130recnd 11173 . . . . . . . . . 10 (𝑥𝐵 → (norm𝑥) ∈ ℂ)
322sheli 31285 . . . . . . . . . . . 12 (𝑦𝐴𝑦 ∈ ℋ)
33 normcl 31196 . . . . . . . . . . . 12 (𝑦 ∈ ℋ → (norm𝑦) ∈ ℝ)
3432, 33syl 17 . . . . . . . . . . 11 (𝑦𝐴 → (norm𝑦) ∈ ℝ)
3534recnd 11173 . . . . . . . . . 10 (𝑦𝐴 → (norm𝑦) ∈ ℂ)
36 addcom 11332 . . . . . . . . . 10 (((norm𝑥) ∈ ℂ ∧ (norm𝑦) ∈ ℂ) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
3731, 35, 36syl2an 597 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
38 ax-hvcom 31072 . . . . . . . . . . . 12 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3928, 32, 38syl2an 597 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐴) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
4039fveq2d 6844 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐴) → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑦 + 𝑥)))
4140oveq2d 7383 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑦 + 𝑥))))
4237, 41breq12d 5098 . . . . . . . 8 ((𝑥𝐵𝑦𝐴) → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4342ralbidva 3158 . . . . . . 7 (𝑥𝐵 → (∀𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4443ralbiia 3081 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))))
45 fveq2 6840 . . . . . . . . 9 (𝑥 = → (norm𝑥) = (norm))
4645oveq2d 7383 . . . . . . . 8 (𝑥 = → ((norm𝑦) + (norm𝑥)) = ((norm𝑦) + (norm)))
47 oveq2 7375 . . . . . . . . . 10 (𝑥 = → (𝑦 + 𝑥) = (𝑦 + ))
4847fveq2d 6844 . . . . . . . . 9 (𝑥 = → (norm‘(𝑦 + 𝑥)) = (norm‘(𝑦 + )))
4948oveq2d 7383 . . . . . . . 8 (𝑥 = → (𝑣 · (norm‘(𝑦 + 𝑥))) = (𝑣 · (norm‘(𝑦 + ))))
5046, 49breq12d 5098 . . . . . . 7 (𝑥 = → (((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + )))))
51 fveq2 6840 . . . . . . . . 9 (𝑦 = 𝑡 → (norm𝑦) = (norm𝑡))
5251oveq1d 7382 . . . . . . . 8 (𝑦 = 𝑡 → ((norm𝑦) + (norm)) = ((norm𝑡) + (norm)))
53 fvoveq1 7390 . . . . . . . . 9 (𝑦 = 𝑡 → (norm‘(𝑦 + )) = (norm‘(𝑡 + )))
5453oveq2d 7383 . . . . . . . 8 (𝑦 = 𝑡 → (𝑣 · (norm‘(𝑦 + ))) = (𝑣 · (norm‘(𝑡 + ))))
5552, 54breq12d 5098 . . . . . . 7 (𝑦 = 𝑡 → (((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + ))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
5650, 55cbvral2vw 3219 . . . . . 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 3084 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
612, 1shscomi 31434 . . . . 5 (𝐴 + 𝐵) = (𝐵 + 𝐴)
6261raleqi 3293 . . . 4 (∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)) ↔ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)))
6362anbi2i 624 . . 3 ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6463rexbii 3084 . 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 3051  wrex 3061   class class class wbr 5085  cmpt 5166  cfv 6498  crio 7323  (class class class)co 7367  cc 11036  cr 11037  0cc0 11038   + caddc 11041   · cmul 11043   < clt 11179  cle 11180  chba 30990   + cva 30991  normcno 30994   S csh 30999   + cph 31002
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 2708  ax-rep 5212  ax-sep 5231  ax-nul 5241  ax-pow 5307  ax-pr 5375  ax-un 7689  ax-cnex 11094  ax-resscn 11095  ax-1cn 11096  ax-icn 11097  ax-addcl 11098  ax-addrcl 11099  ax-mulcl 11100  ax-mulrcl 11101  ax-mulcom 11102  ax-addass 11103  ax-mulass 11104  ax-distr 11105  ax-i2m1 11106  ax-1ne0 11107  ax-1rid 11108  ax-rnegex 11109  ax-rrecex 11110  ax-cnre 11111  ax-pre-lttri 11112  ax-pre-lttrn 11113  ax-pre-ltadd 11114  ax-pre-mulgt0 11115  ax-pre-sup 11116  ax-hilex 31070  ax-hfvadd 31071  ax-hvcom 31072  ax-hvass 31073  ax-hv0cl 31074  ax-hvaddid 31075  ax-hfvmul 31076  ax-hvmulid 31077  ax-hvmulass 31078  ax-hvdistr1 31079  ax-hvdistr2 31080  ax-hvmul0 31081  ax-hfi 31150  ax-his1 31153  ax-his3 31155  ax-his4 31156
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 2539  df-eu 2569  df-clab 2715  df-cleq 2728  df-clel 2811  df-nfc 2885  df-ne 2933  df-nel 3037  df-ral 3052  df-rex 3062  df-rmo 3342  df-reu 3343  df-rab 3390  df-v 3431  df-sbc 3729  df-csb 3838  df-dif 3892  df-un 3894  df-in 3896  df-ss 3906  df-pss 3909  df-nul 4274  df-if 4467  df-pw 4543  df-sn 4568  df-pr 4570  df-op 4574  df-uni 4851  df-int 4890  df-iun 4935  df-br 5086  df-opab 5148  df-mpt 5167  df-tr 5193  df-id 5526  df-eprel 5531  df-po 5539  df-so 5540  df-fr 5584  df-we 5586  df-xp 5637  df-rel 5638  df-cnv 5639  df-co 5640  df-dm 5641  df-rn 5642  df-res 5643  df-ima 5644  df-pred 6265  df-ord 6326  df-on 6327  df-lim 6328  df-suc 6329  df-iota 6454  df-fun 6500  df-fn 6501  df-f 6502  df-f1 6503  df-fo 6504  df-f1o 6505  df-fv 6506  df-riota 7324  df-ov 7370  df-oprab 7371  df-mpo 7372  df-om 7818  df-2nd 7943  df-frecs 8231  df-wrecs 8262  df-recs 8311  df-rdg 8349  df-er 8643  df-en 8894  df-dom 8895  df-sdom 8896  df-sup 9355  df-pnf 11181  df-mnf 11182  df-xr 11183  df-ltxr 11184  df-le 11185  df-sub 11379  df-neg 11380  df-div 11808  df-nn 12175  df-2 12244  df-3 12245  df-n0 12438  df-z 12525  df-uz 12789  df-rp 12943  df-seq 13964  df-exp 14024  df-cj 15061  df-re 15062  df-im 15063  df-sqrt 15197  df-abs 15198  df-grpo 30564  df-ablo 30616  df-hnorm 31039  df-hvsub 31042  df-sh 31278  df-ch0 31324  df-shs 31379
This theorem is referenced by:  cdj3i  32512
  Copyright terms: Public domain W3C validator