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

Theorem strlem1 32898
Description: Lemma for strong state theorem: if closed subspace 𝐴 is not contained in 𝐵, there is a unit vector 𝑢 in their difference. (Contributed by NM, 25-Oct-1999.) (New usage is discouraged.)
Hypotheses
Ref Expression
strlem1.1 𝐴 ∈ Cℋ
strlem1.2 𝐵 ∈ Cℋ
Assertion
Ref Expression
strlem1 (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
Distinct variable groups:   𝑢,𝐴   𝑢,𝐵

Proof of Theorem strlem1
Dummy variable 𝑥 is distinct from all other variables.
StepHypRef Expression
1 neq0 4302 . . 3 (¬ (𝐴 ∖ 𝐵) = ∅ ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
2 ssdif0 4317 . . 3 (𝐴 ⊆ 𝐵 ↔ (𝐴 ∖ 𝐵) = ∅)
31, 2xchnxbir 336 . 2 (¬ 𝐴 ⊆ 𝐵 ↔ ∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵))
4 eldifi 4070 . . . . . . . . . . 11 (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ 𝐴)
5 strlem1.1 . . . . . . . . . . . 12 𝐴 ∈ Cℋ
65cheli 31880 . . . . . . . . . . 11 (𝑥 ∈ 𝐴 → 𝑥 ∈ ℋ)
7 normcl 31773 . . . . . . . . . . 11 (𝑥 ∈ ℋ → (normℎ‘𝑥) ∈ ℝ)
84, 6, 73syl 19 . . . . . . . . . 10 (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℝ)
9 strlem1.2 . . . . . . . . . . . . . . . 16 𝐵 ∈ Cℋ
10 ch0 31876 . . . . . . . . . . . . . . . 16 (𝐵 ∈ Cℋ → 0ℎ ∈ 𝐵)
119, 10ax-mp 5 . . . . . . . . . . . . . . 15 0ℎ ∈ 𝐵
12 eldifn 4071 . . . . . . . . . . . . . . 15 (0ℎ ∈ (𝐴 ∖ 𝐵) → ¬ 0ℎ ∈ 𝐵)
1311, 12mt2 203 . . . . . . . . . . . . . 14 ¬ 0ℎ ∈ (𝐴 ∖ 𝐵)
14 eleq1 2852 . . . . . . . . . . . . . 14 (𝑥 = 0ℎ → (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ 0ℎ ∈ (𝐴 ∖ 𝐵)))
1513, 14mtbiri 330 . . . . . . . . . . . . 13 (𝑥 = 0ℎ → ¬ 𝑥 ∈ (𝐴 ∖ 𝐵))
1615con2i 140 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ 𝑥 = 0ℎ)
17 norm-i 31777 . . . . . . . . . . . . 13 (𝑥 ∈ ℋ → ((normℎ‘𝑥) = 0 ↔ 𝑥 = 0ℎ))
184, 6, 173syl 19 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) = 0 ↔ 𝑥 = 0ℎ))
1916, 18mtbird 328 . . . . . . . . . . 11 (𝑥 ∈ (𝐴 ∖ 𝐵) → ¬ (normℎ‘𝑥) = 0)
2019neqned 2966 . . . . . . . . . 10 (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ≠ 0)
218, 20rereccld 12182 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℝ)
2221recnd 11374 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 / (normℎ‘𝑥)) ∈ ℂ)
235chshii 31875 . . . . . . . . . 10 𝐴 ∈ Sℋ
24 shmulcl 31866 . . . . . . . . . 10 ((𝐴 ∈ Sℋ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
2523, 24mp3an1 1478 . . . . . . . . 9 (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ 𝐴) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴)
2625ex 418 . . . . . . . 8 ((1 / (normℎ‘𝑥)) ∈ ℂ → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
2722, 26syl 18 . . . . . . 7 (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ 𝐴 → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴))
288recnd 11374 . . . . . . . . . 10 (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘𝑥) ∈ ℂ)
299chshii 31875 . . . . . . . . . . . 12 𝐵 ∈ Sℋ
30 shmulcl 31866 . . . . . . . . . . . 12 ((𝐵 ∈ Sℋ ∧ (normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
3129, 30mp3an1 1478 . . . . . . . . . . 11 (((normℎ‘𝑥) ∈ ℂ ∧ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵)
3231ex 418 . . . . . . . . . 10 ((normℎ‘𝑥) ∈ ℂ → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
3328, 32syl 18 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵))
3428, 20recidd 12126 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) = 1)
3534oveq1d 7464 . . . . . . . . . . 11 (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = (1 ·ℎ 𝑥))
364, 6syl 18 . . . . . . . . . . . 12 (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ∈ ℋ)
37 ax-hvmulass 31655 . . . . . . . . . . . 12 (((normℎ‘𝑥) ∈ ℂ ∧ (1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
3828, 22, 36, 37syl3anc 1399 . . . . . . . . . . 11 (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) · (1 / (normℎ‘𝑥))) ·ℎ 𝑥) = ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)))
39 ax-hvmulid 31654 . . . . . . . . . . . 12 (𝑥 ∈ ℋ → (1 ·ℎ 𝑥) = 𝑥)
404, 6, 393syl 19 . . . . . . . . . . 11 (𝑥 ∈ (𝐴 ∖ 𝐵) → (1 ·ℎ 𝑥) = 𝑥)
4135, 38, 403eqtr3d 2806 . . . . . . . . . 10 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 𝑥)
4241eleq1d 2849 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ 𝐵) → (((normℎ‘𝑥) ·ℎ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) ∈ 𝐵 ↔ 𝑥 ∈ 𝐵))
4333, 42sylibd 242 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵 → 𝑥 ∈ 𝐵))
4443con3d 153 . . . . . . 7 (𝑥 ∈ (𝐴 ∖ 𝐵) → (¬ 𝑥 ∈ 𝐵 → ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
4527, 44anim12d 621 . . . . . 6 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵) → (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵)))
46 eldif 4052 . . . . . 6 (𝑥 ∈ (𝐴 ∖ 𝐵) ↔ (𝑥 ∈ 𝐴 ∧ ¬ 𝑥 ∈ 𝐵))
47 eldif 4052 . . . . . 6 (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ↔ (((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐴 ∧ ¬ ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ 𝐵))
4845, 46, 473imtr4g 299 . . . . 5 (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵)))
4948pm2.43i 53 . . . 4 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵))
50 norm-iii 31788 . . . . . 6 (((1 / (normℎ‘𝑥)) ∈ ℂ ∧ 𝑥 ∈ ℋ) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
5122, 36, 50syl2anc 596 . . . . 5 (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)))
5215necon2ai 2988 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ 𝐵) → 𝑥 ≠ 0ℎ)
53 normgt0 31775 . . . . . . . . . 10 (𝑥 ∈ ℋ → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
544, 6, 533syl 19 . . . . . . . . 9 (𝑥 ∈ (𝐴 ∖ 𝐵) → (𝑥 ≠ 0ℎ ↔ 0 < (normℎ‘𝑥)))
5552, 54mpbid 235 . . . . . . . 8 (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 < (normℎ‘𝑥))
56 1re 11345 . . . . . . . . 9 1 ∈ ℝ
57 0le1 11877 . . . . . . . . 9 0 ≤ 1
58 divge0 12224 . . . . . . . . 9 (((1 ∈ ℝ ∧ 0 ≤ 1) ∧ ((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥))) → 0 ≤ (1 / (normℎ‘𝑥)))
5956, 57, 58mpanl12 715 . . . . . . . 8 (((normℎ‘𝑥) ∈ ℝ ∧ 0 < (normℎ‘𝑥)) → 0 ≤ (1 / (normℎ‘𝑥)))
608, 55, 59syl2anc 596 . . . . . . 7 (𝑥 ∈ (𝐴 ∖ 𝐵) → 0 ≤ (1 / (normℎ‘𝑥)))
6121, 60absidd 15631 . . . . . 6 (𝑥 ∈ (𝐴 ∖ 𝐵) → (abs‘(1 / (normℎ‘𝑥))) = (1 / (normℎ‘𝑥)))
6261oveq1d 7464 . . . . 5 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((abs‘(1 / (normℎ‘𝑥))) · (normℎ‘𝑥)) = ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)))
6328, 20recid2d 12127 . . . . 5 (𝑥 ∈ (𝐴 ∖ 𝐵) → ((1 / (normℎ‘𝑥)) · (normℎ‘𝑥)) = 1)
6451, 62, 633eqtrd 2802 . . . 4 (𝑥 ∈ (𝐴 ∖ 𝐵) → (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1)
65 fveqeq2 6923 . . . . 5 (𝑢 = ((1 / (normℎ‘𝑥)) ·ℎ 𝑥) → ((normℎ‘𝑢) = 1 ↔ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1))
6665rspcev 3580 . . . 4 ((((1 / (normℎ‘𝑥)) ·ℎ 𝑥) ∈ (𝐴 ∖ 𝐵) ∧ (normℎ‘((1 / (normℎ‘𝑥)) ·ℎ 𝑥)) = 1) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
6749, 64, 66syl2anc 596 . . 3 (𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
6867exlimiv 1965 . 2 (∃𝑥 𝑥 ∈ (𝐴 ∖ 𝐵) → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
693, 68sylbi 220 1 (¬ 𝐴 ⊆ 𝐵 → ∃𝑢 ∈ (𝐴 ∖ 𝐵)(normℎ‘𝑢) = 1)
Colors of variables:    wff setvar class
This proof depends on syntax axioms:  ¬ wn 3   → wi 4   ↔ wb 209   ∧ wa 401   = wceq 1570  ∃wex 1812   ∈ wcel 2147   ≠ wne 2959  ∃wrex 3090   ⊆ wss 3900   ∖ cdif 4048  ∅c0 4281   class class class wbr 5106  ‘cfv 6564  (class class class)co 7449  ℂcc 11235  ℝcr 11236  0cc0 11237  1c1 11238   · cmul 11242   < clt 11380   ≤ cle 11381   / cdiv 12011  abscabs 15442   ℋchba 31567   ·ℎ csm 31569  normℎcno 31571  0ℎc0v 31572   Sℋ csh 31576   Cℋ cch 31577
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 1945  ax-6 2002  ax-7 2043  ax-8 2149  ax-9 2157  ax-10 2180  ax-11 2197  ax-12 2216  ax-ext 2735  ax-sep 5253  ax-nul 5264  ax-pow 5332  ax-pr 5396  ax-un 7781  ax-cnex 11293  ax-resscn 11294  ax-1cn 11295  ax-icn 11296  ax-addcl 11297  ax-addrcl 11298  ax-mulcl 11299  ax-mulrcl 11300  ax-mulcom 11301  ax-addass 11302  ax-mulass 11303  ax-distr 11304  ax-i2m1 11305  ax-1ne0 11306  ax-1rid 11307  ax-rnegex 11308  ax-rrecex 11309  ax-cnre 11310  ax-pre-lttri 11311  ax-pre-lttrn 11312  ax-pre-ltadd 11313  ax-pre-mulgt0 11314  ax-pre-sup 11315  ax-hilex 31647  ax-hfvadd 31648  ax-hv0cl 31651  ax-hfvmul 31653  ax-hvmulid 31654  ax-hvmulass 31655  ax-hvmul0 31658  ax-hfi 31727  ax-his1 31730  ax-his3 31732  ax-his4 31733
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 2102  df-mo 2567  df-eu 2597  df-clab 2742  df-cleq 2755  df-clel 2839  df-nfc 2913  df-ne 2960  df-nel 3066  df-ral 3081  df-rex 3091  df-rmo 3369  df-reu 3370  df-rab 3417  df-v 3456  df-sbc 3743  df-csb 3852  df-ss 3901  df-pss 4017  df-dif 4050  df-in 4094  df-un 4154  df-nul 4282  df-if 4486  df-pw 4562  df-sn 4589  df-pr 4591  df-op 4839  df-uni 4871  df-iun 4956  df-br 5107  df-opab 5172  df-mpt 5191  df-tr 5217  df-id 5551  df-eprel 5556  df-po 5564  df-so 5565  df-fr 5609  df-we 5611  df-xp 5662  df-rel 5663  df-cnv 5664  df-co 5665  df-dm 5666  df-rn 5667  df-res 5668  df-ima 5669  df-pred 6328  df-ord 6389  df-on 6390  df-lim 6391  df-suc 6392  df-iota 6518  df-fun 6566  df-fn 6567  df-f 6568  df-f1 6569  df-fo 6570  df-f1o 6571  df-fv 6572  df-riota 7406  df-ov 7452  df-oprab 7453  df-mpo 7454  df-om 7910  df-2nd 8034  df-frecs 8335  df-wrecs 8366  df-recs 8415  df-rdg 8454  df-er 8753  df-en 9010  df-dom 9011  df-sdom 9012  df-sup 9469  df-pnf 11382  df-mnf 11383  df-xr 11384  df-ltxr 11385  df-le 11386  df-sub 11580  df-neg 11581  df-div 12012  df-nn 12374  df-2 12443  df-3 12444  df-n0 12645  df-z 12732  df-uz 13004  df-rp 13159  df-seq 14183  df-exp 14243  df-cj 15307  df-re 15308  df-im 15309  df-sqrt 15443  df-abs 15444  df-hnorm 31616  df-sh 31855  df-ch 31869
This theorem is used by:  stri  32905  hstri  32913
  Copyright terms: Public domain W3C validator