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

Theorem cdj3lem3b 30220
Description: Lemma for cdj3i 30221. 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 29143 . . . . 5 (𝐵 + 𝐴) = (𝐴 + 𝐵)
51sheli 28994 . . . . . . . . 9 (𝑤𝐵𝑤 ∈ ℋ)
62sheli 28994 . . . . . . . . 9 (𝑧𝐴𝑧 ∈ ℋ)
7 ax-hvcom 28781 . . . . . . . . 9 ((𝑤 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
85, 6, 7syl2an 597 . . . . . . . 8 ((𝑤𝐵𝑧𝐴) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
98eqeq2d 2835 . . . . . . 7 ((𝑤𝐵𝑧𝐴) → (𝑥 = (𝑤 + 𝑧) ↔ 𝑥 = (𝑧 + 𝑤)))
109rexbidva 3299 . . . . . 6 (𝑤𝐵 → (∃𝑧𝐴 𝑥 = (𝑤 + 𝑧) ↔ ∃𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
1110riotabiia 7137 . . . . 5 (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)) = (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤))
124, 11mpteq12i 5162 . . . 4 (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧))) = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
133, 12eqtr4i 2850 . . 3 𝑇 = (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)))
141, 2, 13cdj3lem2b 30217 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
15 fveq2 6673 . . . . . . . 8 (𝑥 = 𝑡 → (norm𝑥) = (norm𝑡))
1615oveq1d 7174 . . . . . . 7 (𝑥 = 𝑡 → ((norm𝑥) + (norm𝑦)) = ((norm𝑡) + (norm𝑦)))
17 fvoveq1 7182 . . . . . . . 8 (𝑥 = 𝑡 → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑡 + 𝑦)))
1817oveq2d 7175 . . . . . . 7 (𝑥 = 𝑡 → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑡 + 𝑦))))
1916, 18breq12d 5082 . . . . . 6 (𝑥 = 𝑡 → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦)))))
20 fveq2 6673 . . . . . . . 8 (𝑦 = → (norm𝑦) = (norm))
2120oveq2d 7175 . . . . . . 7 (𝑦 = → ((norm𝑡) + (norm𝑦)) = ((norm𝑡) + (norm)))
22 oveq2 7167 . . . . . . . . 9 (𝑦 = → (𝑡 + 𝑦) = (𝑡 + ))
2322fveq2d 6677 . . . . . . . 8 (𝑦 = → (norm‘(𝑡 + 𝑦)) = (norm‘(𝑡 + )))
2423oveq2d 7175 . . . . . . 7 (𝑦 = → (𝑣 · (norm‘(𝑡 + 𝑦))) = (𝑣 · (norm‘(𝑡 + ))))
2521, 24breq12d 5082 . . . . . 6 (𝑦 = → (((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
2619, 25cbvral2vw 3464 . . . . 5 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
27 ralcom 3357 . . . . 5 (∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
281sheli 28994 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ ℋ)
29 normcl 28905 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (norm𝑥) ∈ ℝ)
3028, 29syl 17 . . . . . . . . . . 11 (𝑥𝐵 → (norm𝑥) ∈ ℝ)
3130recnd 10672 . . . . . . . . . 10 (𝑥𝐵 → (norm𝑥) ∈ ℂ)
322sheli 28994 . . . . . . . . . . . 12 (𝑦𝐴𝑦 ∈ ℋ)
33 normcl 28905 . . . . . . . . . . . 12 (𝑦 ∈ ℋ → (norm𝑦) ∈ ℝ)
3432, 33syl 17 . . . . . . . . . . 11 (𝑦𝐴 → (norm𝑦) ∈ ℝ)
3534recnd 10672 . . . . . . . . . 10 (𝑦𝐴 → (norm𝑦) ∈ ℂ)
36 addcom 10829 . . . . . . . . . 10 (((norm𝑥) ∈ ℂ ∧ (norm𝑦) ∈ ℂ) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
3731, 35, 36syl2an 597 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
38 ax-hvcom 28781 . . . . . . . . . . . 12 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3928, 32, 38syl2an 597 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐴) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
4039fveq2d 6677 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐴) → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑦 + 𝑥)))
4140oveq2d 7175 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑦 + 𝑥))))
4237, 41breq12d 5082 . . . . . . . 8 ((𝑥𝐵𝑦𝐴) → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4342ralbidva 3199 . . . . . . 7 (𝑥𝐵 → (∀𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4443ralbiia 3167 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))))
45 fveq2 6673 . . . . . . . . 9 (𝑥 = → (norm𝑥) = (norm))
4645oveq2d 7175 . . . . . . . 8 (𝑥 = → ((norm𝑦) + (norm𝑥)) = ((norm𝑦) + (norm)))
47 oveq2 7167 . . . . . . . . . 10 (𝑥 = → (𝑦 + 𝑥) = (𝑦 + ))
4847fveq2d 6677 . . . . . . . . 9 (𝑥 = → (norm‘(𝑦 + 𝑥)) = (norm‘(𝑦 + )))
4948oveq2d 7175 . . . . . . . 8 (𝑥 = → (𝑣 · (norm‘(𝑦 + 𝑥))) = (𝑣 · (norm‘(𝑦 + ))))
5046, 49breq12d 5082 . . . . . . 7 (𝑥 = → (((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + )))))
51 fveq2 6673 . . . . . . . . 9 (𝑦 = 𝑡 → (norm𝑦) = (norm𝑡))
5251oveq1d 7174 . . . . . . . 8 (𝑦 = 𝑡 → ((norm𝑦) + (norm)) = ((norm𝑡) + (norm)))
53 fvoveq1 7182 . . . . . . . . 9 (𝑦 = 𝑡 → (norm‘(𝑦 + )) = (norm‘(𝑡 + )))
5453oveq2d 7175 . . . . . . . 8 (𝑦 = 𝑡 → (𝑣 · (norm‘(𝑦 + ))) = (𝑣 · (norm‘(𝑡 + ))))
5552, 54breq12d 5082 . . . . . . 7 (𝑦 = 𝑡 → (((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + ))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
5650, 55cbvral2vw 3464 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
5744, 56bitr2i 278 . . . . 5 (∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5826, 27, 573bitri 299 . . . 4 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))))
5958anbi2i 624 . . 3 ((0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
6059rexbii 3250 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
612, 1shscomi 29143 . . . . 5 (𝐴 + 𝐵) = (𝐵 + 𝐴)
6261raleqi 3416 . . . 4 (∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)) ↔ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)))
6362anbi2i 624 . . 3 ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6463rexbii 3250 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6514, 60, 643imtr4i 294 1 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
Colors of variables: wff setvar class
Syntax hints:  wi 4  wa 398   = wceq 1536  wcel 2113  wral 3141  wrex 3142   class class class wbr 5069  cmpt 5149  cfv 6358  crio 7116  (class class class)co 7159  cc 10538  cr 10539  0cc0 10540   + caddc 10543   · cmul 10545   < clt 10678  cle 10679  chba 28699   + cva 28700  normcno 28703   S csh 28708   + cph 28711
This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1795  ax-4 1809  ax-5 1910  ax-6 1969  ax-7 2014  ax-8 2115  ax-9 2123  ax-10 2144  ax-11 2160  ax-12 2176  ax-ext 2796  ax-rep 5193  ax-sep 5206  ax-nul 5213  ax-pow 5269  ax-pr 5333  ax-un 7464  ax-cnex 10596  ax-resscn 10597  ax-1cn 10598  ax-icn 10599  ax-addcl 10600  ax-addrcl 10601  ax-mulcl 10602  ax-mulrcl 10603  ax-mulcom 10604  ax-addass 10605  ax-mulass 10606  ax-distr 10607  ax-i2m1 10608  ax-1ne0 10609  ax-1rid 10610  ax-rnegex 10611  ax-rrecex 10612  ax-cnre 10613  ax-pre-lttri 10614  ax-pre-lttrn 10615  ax-pre-ltadd 10616  ax-pre-mulgt0 10617  ax-pre-sup 10618  ax-hilex 28779  ax-hfvadd 28780  ax-hvcom 28781  ax-hvass 28782  ax-hv0cl 28783  ax-hvaddid 28784  ax-hfvmul 28785  ax-hvmulid 28786  ax-hvmulass 28787  ax-hvdistr1 28788  ax-hvdistr2 28789  ax-hvmul0 28790  ax-hfi 28859  ax-his1 28862  ax-his3 28864  ax-his4 28865
This theorem depends on definitions:  df-bi 209  df-an 399  df-or 844  df-3or 1084  df-3an 1085  df-tru 1539  df-ex 1780  df-nf 1784  df-sb 2069  df-mo 2621  df-eu 2653  df-clab 2803  df-cleq 2817  df-clel 2896  df-nfc 2966  df-ne 3020  df-nel 3127  df-ral 3146  df-rex 3147  df-reu 3148  df-rmo 3149  df-rab 3150  df-v 3499  df-sbc 3776  df-csb 3887  df-dif 3942  df-un 3944  df-in 3946  df-ss 3955  df-pss 3957  df-nul 4295  df-if 4471  df-pw 4544  df-sn 4571  df-pr 4573  df-tp 4575  df-op 4577  df-uni 4842  df-int 4880  df-iun 4924  df-br 5070  df-opab 5132  df-mpt 5150  df-tr 5176  df-id 5463  df-eprel 5468  df-po 5477  df-so 5478  df-fr 5517  df-we 5519  df-xp 5564  df-rel 5565  df-cnv 5566  df-co 5567  df-dm 5568  df-rn 5569  df-res 5570  df-ima 5571  df-pred 6151  df-ord 6197  df-on 6198  df-lim 6199  df-suc 6200  df-iota 6317  df-fun 6360  df-fn 6361  df-f 6362  df-f1 6363  df-fo 6364  df-f1o 6365  df-fv 6366  df-riota 7117  df-ov 7162  df-oprab 7163  df-mpo 7164  df-om 7584  df-2nd 7693  df-wrecs 7950  df-recs 8011  df-rdg 8049  df-er 8292  df-en 8513  df-dom 8514  df-sdom 8515  df-sup 8909  df-pnf 10680  df-mnf 10681  df-xr 10682  df-ltxr 10683  df-le 10684  df-sub 10875  df-neg 10876  df-div 11301  df-nn 11642  df-2 11703  df-3 11704  df-n0 11901  df-z 11985  df-uz 12247  df-rp 12393  df-seq 13373  df-exp 13433  df-cj 14461  df-re 14462  df-im 14463  df-sqrt 14597  df-abs 14598  df-grpo 28273  df-ablo 28325  df-hnorm 28748  df-hvsub 28751  df-sh 28987  df-ch0 29033  df-shs 29088
This theorem is referenced by:  cdj3i  30221
  Copyright terms: Public domain W3C validator