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

Theorem cdj3lem3b 32863
Description: Lemma for cdj3i 32864. 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 31786 . . . . 5 (𝐵 + 𝐴) = (𝐴 + 𝐵)
51sheli 31637 . . . . . . . . 9 (𝑤𝐵𝑤 ∈ ℋ)
62sheli 31637 . . . . . . . . 9 (𝑧𝐴𝑧 ∈ ℋ)
7 ax-hvcom 31424 . . . . . . . . 9 ((𝑤 ∈ ℋ ∧ 𝑧 ∈ ℋ) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
85, 6, 7syl2an 608 . . . . . . . 8 ((𝑤𝐵𝑧𝐴) → (𝑤 + 𝑧) = (𝑧 + 𝑤))
98eqeq2d 2776 . . . . . . 7 ((𝑤𝐵𝑧𝐴) → (𝑥 = (𝑤 + 𝑧) ↔ 𝑥 = (𝑧 + 𝑤)))
109rexbidva 3189 . . . . . 6 (𝑤𝐵 → (∃𝑧𝐴 𝑥 = (𝑤 + 𝑧) ↔ ∃𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
1110riotabiia 7396 . . . . 5 (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)) = (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤))
124, 11mpteq12i 5210 . . . 4 (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧))) = (𝑥 ∈ (𝐴 + 𝐵) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑧 + 𝑤)))
133, 12eqtr4i 2791 . . 3 𝑇 = (𝑥 ∈ (𝐵 + 𝐴) ↦ (𝑤𝐵𝑧𝐴 𝑥 = (𝑤 + 𝑧)))
141, 2, 13cdj3lem2b 32860 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) → ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
15 fveq2 6885 . . . . . . . 8 (𝑥 = 𝑡 → (norm𝑥) = (norm𝑡))
1615oveq1d 7434 . . . . . . 7 (𝑥 = 𝑡 → ((norm𝑥) + (norm𝑦)) = ((norm𝑡) + (norm𝑦)))
17 fvoveq1 7442 . . . . . . . 8 (𝑥 = 𝑡 → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑡 + 𝑦)))
1817oveq2d 7435 . . . . . . 7 (𝑥 = 𝑡 → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑡 + 𝑦))))
1916, 18breq12d 5124 . . . . . 6 (𝑥 = 𝑡 → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦)))))
20 fveq2 6885 . . . . . . . 8 (𝑦 = → (norm𝑦) = (norm))
2120oveq2d 7435 . . . . . . 7 (𝑦 = → ((norm𝑡) + (norm𝑦)) = ((norm𝑡) + (norm)))
22 oveq2 7427 . . . . . . . . 9 (𝑦 = → (𝑡 + 𝑦) = (𝑡 + ))
2322fveq2d 6889 . . . . . . . 8 (𝑦 = → (norm‘(𝑡 + 𝑦)) = (norm‘(𝑡 + )))
2423oveq2d 7435 . . . . . . 7 (𝑦 = → (𝑣 · (norm‘(𝑡 + 𝑦))) = (𝑣 · (norm‘(𝑡 + ))))
2521, 24breq12d 5124 . . . . . 6 (𝑦 = → (((norm𝑡) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑡 + 𝑦))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
2619, 25cbvral2vw 3249 . . . . 5 (∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
27 ralcom 3295 . . . . 5 (∀𝑡𝐴𝐵 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))) ↔ ∀𝐵𝑡𝐴 ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + ))))
281sheli 31637 . . . . . . . . . . . 12 (𝑥𝐵𝑥 ∈ ℋ)
29 normcl 31548 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (norm𝑥) ∈ ℝ)
3028, 29syl 18 . . . . . . . . . . 11 (𝑥𝐵 → (norm𝑥) ∈ ℝ)
3130recnd 11252 . . . . . . . . . 10 (𝑥𝐵 → (norm𝑥) ∈ ℂ)
322sheli 31637 . . . . . . . . . . . 12 (𝑦𝐴𝑦 ∈ ℋ)
33 normcl 31548 . . . . . . . . . . . 12 (𝑦 ∈ ℋ → (norm𝑦) ∈ ℝ)
3432, 33syl 18 . . . . . . . . . . 11 (𝑦𝐴 → (norm𝑦) ∈ ℝ)
3534recnd 11252 . . . . . . . . . 10 (𝑦𝐴 → (norm𝑦) ∈ ℂ)
36 addcom 11411 . . . . . . . . . 10 (((norm𝑥) ∈ ℂ ∧ (norm𝑦) ∈ ℂ) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
3731, 35, 36syl2an 608 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → ((norm𝑥) + (norm𝑦)) = ((norm𝑦) + (norm𝑥)))
38 ax-hvcom 31424 . . . . . . . . . . . 12 ((𝑥 ∈ ℋ ∧ 𝑦 ∈ ℋ) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
3928, 32, 38syl2an 608 . . . . . . . . . . 11 ((𝑥𝐵𝑦𝐴) → (𝑥 + 𝑦) = (𝑦 + 𝑥))
4039fveq2d 6889 . . . . . . . . . 10 ((𝑥𝐵𝑦𝐴) → (norm‘(𝑥 + 𝑦)) = (norm‘(𝑦 + 𝑥)))
4140oveq2d 7435 . . . . . . . . 9 ((𝑥𝐵𝑦𝐴) → (𝑣 · (norm‘(𝑥 + 𝑦))) = (𝑣 · (norm‘(𝑦 + 𝑥))))
4237, 41breq12d 5124 . . . . . . . 8 ((𝑥𝐵𝑦𝐴) → (((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4342ralbidva 3188 . . . . . . 7 (𝑥𝐵 → (∀𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥)))))
4443ralbiia 3111 . . . . . 6 (∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦))) ↔ ∀𝑥𝐵𝑦𝐴 ((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))))
45 fveq2 6885 . . . . . . . . 9 (𝑥 = → (norm𝑥) = (norm))
4645oveq2d 7435 . . . . . . . 8 (𝑥 = → ((norm𝑦) + (norm𝑥)) = ((norm𝑦) + (norm)))
47 oveq2 7427 . . . . . . . . . 10 (𝑥 = → (𝑦 + 𝑥) = (𝑦 + ))
4847fveq2d 6889 . . . . . . . . 9 (𝑥 = → (norm‘(𝑦 + 𝑥)) = (norm‘(𝑦 + )))
4948oveq2d 7435 . . . . . . . 8 (𝑥 = → (𝑣 · (norm‘(𝑦 + 𝑥))) = (𝑣 · (norm‘(𝑦 + ))))
5046, 49breq12d 5124 . . . . . . 7 (𝑥 = → (((norm𝑦) + (norm𝑥)) ≤ (𝑣 · (norm‘(𝑦 + 𝑥))) ↔ ((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + )))))
51 fveq2 6885 . . . . . . . . 9 (𝑦 = 𝑡 → (norm𝑦) = (norm𝑡))
5251oveq1d 7434 . . . . . . . 8 (𝑦 = 𝑡 → ((norm𝑦) + (norm)) = ((norm𝑡) + (norm)))
53 fvoveq1 7442 . . . . . . . . 9 (𝑦 = 𝑡 → (norm‘(𝑦 + )) = (norm‘(𝑡 + )))
5453oveq2d 7435 . . . . . . . 8 (𝑦 = 𝑡 → (𝑣 · (norm‘(𝑦 + ))) = (𝑣 · (norm‘(𝑡 + ))))
5552, 54breq12d 5124 . . . . . . 7 (𝑦 = 𝑡 → (((norm𝑦) + (norm)) ≤ (𝑣 · (norm‘(𝑦 + ))) ↔ ((norm𝑡) + (norm)) ≤ (𝑣 · (norm‘(𝑡 + )))))
5650, 55cbvral2vw 3249 . . . . . 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 635 . . 3 ((0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
6059rexbii 3114 . 2 (∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐴𝑦𝐵 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))) ↔ ∃𝑣 ∈ ℝ (0 < 𝑣 ∧ ∀𝑥𝐵𝑦𝐴 ((norm𝑥) + (norm𝑦)) ≤ (𝑣 · (norm‘(𝑥 + 𝑦)))))
612, 1shscomi 31786 . . . . 5 (𝐴 + 𝐵) = (𝐵 + 𝐴)
6261raleqi 3323 . . . 4 (∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)) ↔ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢)))
6362anbi2i 635 . . 3 ((0 < 𝑣 ∧ ∀𝑢 ∈ (𝐴 + 𝐵)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))) ↔ (0 < 𝑣 ∧ ∀𝑢 ∈ (𝐵 + 𝐴)(norm‘(𝑇𝑢)) ≤ (𝑣 · (norm𝑢))))
6463rexbii 3114 . 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
This proof depends on syntax axioms:  wi 4  wa 401   = wceq 1570  wcel 2146  wral 3081  wrex 3091   class class class wbr 5111  cmpt 5194  cfv 6540  crio 7375  (class class class)co 7419  cc 11113  cr 11114  0cc0 11115   + caddc 11118   · cmul 11120   < clt 11258  cle 11259  chba 31342   + cva 31343  normcno 31346   S csh 31351   + cph 31354
This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-3 8  ax-gen 1828  ax-4 1842  ax-5 1943  ax-6 2000  ax-7 2041  ax-8 2148  ax-9 2156  ax-10 2179  ax-11 2195  ax-12 2216  ax-ext 2737  ax-rep 5240  ax-sep 5259  ax-nul 5271  ax-pow 5338  ax-pr 5406  ax-un 7742  ax-cnex 11171  ax-resscn 11172  ax-1cn 11173  ax-icn 11174  ax-addcl 11175  ax-addrcl 11176  ax-mulcl 11177  ax-mulrcl 11178  ax-mulcom 11179  ax-addass 11180  ax-mulass 11181  ax-distr 11182  ax-i2m1 11183  ax-1ne0 11184  ax-1rid 11185  ax-rnegex 11186  ax-rrecex 11187  ax-cnre 11188  ax-pre-lttri 11189  ax-pre-lttrn 11190  ax-pre-ltadd 11191  ax-pre-mulgt0 11192  ax-pre-sup 11193  ax-hilex 31422  ax-hfvadd 31423  ax-hvcom 31424  ax-hvass 31425  ax-hv0cl 31426  ax-hvaddid 31427  ax-hfvmul 31428  ax-hvmulid 31429  ax-hvmulass 31430  ax-hvdistr1 31431  ax-hvdistr2 31432  ax-hvmul0 31433  ax-hfi 31502  ax-his1 31505  ax-his3 31507  ax-his4 31508
This proof depends on definitions:  df-bi 210  df-an 402  df-or 862  df-3or 1104  df-3an 1105  df-tru 1573  df-fal 1583  df-ex 1813  df-nf 1817  df-sb 2100  df-mo 2569  df-eu 2599  df-clab 2744  df-cleq 2757  df-clel 2840  df-nfc 2914  df-ne 2961  df-nel 3067  df-ral 3082  df-rex 3092  df-rmo 3371  df-reu 3372  df-rab 3419  df-v 3459  df-sbc 3747  df-csb 3855  df-dif 3909  df-un 3911  df-in 3913  df-ss 3923  df-pss 3926  df-nul 4287  df-if 4490  df-pw 4566  df-sn 4592  df-pr 4594  df-op 4598  df-uni 4875  df-int 4915  df-iun 4960  df-br 5112  df-opab 5176  df-mpt 5195  df-tr 5221  df-id 5558  df-eprel 5563  df-po 5571  df-so 5572  df-fr 5616  df-we 5618  df-xp 5669  df-rel 5670  df-cnv 5671  df-co 5672  df-dm 5673  df-rn 5674  df-res 5675  df-ima 5676  df-pred 6306  df-ord 6367  df-on 6368  df-lim 6369  df-suc 6370  df-iota 6496  df-fun 6542  df-fn 6543  df-f 6544  df-f1 6545  df-fo 6546  df-f1o 6547  df-fv 6548  df-riota 7376  df-ov 7422  df-oprab 7423  df-mpo 7424  df-om 7869  df-2nd 7993  df-frecs 8284  df-wrecs 8315  df-recs 8364  df-rdg 8403  df-er 8700  df-en 8950  df-dom 8951  df-sdom 8952  df-sup 9409  df-pnf 11260  df-mnf 11261  df-xr 11262  df-ltxr 11263  df-le 11264  df-sub 11458  df-neg 11459  df-div 11887  df-nn 12249  df-2 12318  df-3 12319  df-n0 12520  df-z 12607  df-uz 12879  df-rp 13033  df-seq 14056  df-exp 14116  df-cj 15174  df-re 15175  df-im 15176  df-sqrt 15310  df-abs 15311  df-grpo 30916  df-ablo 30968  df-hnorm 31391  df-hvsub 31394  df-sh 31630  df-ch0 31676  df-shs 31731
This theorem is used by:  cdj3i  32864
  Copyright terms: Public domain W3C validator