| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > chscllem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for chscl 31993. (Contributed by Mario Carneiro, 19-May-2014.) (New usage is discouraged.) |
| Ref | Expression |
|---|---|
| chscl.1 | ⊢ (𝜑 → 𝐴 ∈ Cℋ ) |
| chscl.2 | ⊢ (𝜑 → 𝐵 ∈ Cℋ ) |
| chscl.3 | ⊢ (𝜑 → 𝐵 ⊆ (⊥‘𝐴)) |
| chscl.4 | ⊢ (𝜑 → 𝐻:ℕ⟶(𝐴 +ℋ 𝐵)) |
| chscl.5 | ⊢ (𝜑 → 𝐻 ⇝𝑣 𝑢) |
| chscl.6 | ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((projℎ‘𝐴)‘(𝐻‘𝑛))) |
| Ref | Expression |
|---|---|
| chscllem1 | ⊢ (𝜑 → 𝐹:ℕ⟶𝐴) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2763 | . . . 4 ⊢ ((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) | |
| 2 | chscl.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Cℋ ) | |
| 3 | 2 | adantr 485 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ Cℋ ) |
| 4 | chscl.4 | . . . . . . 7 ⊢ (𝜑 → 𝐻:ℕ⟶(𝐴 +ℋ 𝐵)) | |
| 5 | 4 | ffvelcdmda 7079 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) |
| 6 | chscl.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ Cℋ ) | |
| 7 | chsh 31576 | . . . . . . . . . 10 ⊢ (𝐵 ∈ Cℋ → 𝐵 ∈ Sℋ ) | |
| 8 | 6, 7 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Sℋ ) |
| 9 | chsh 31576 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ Cℋ → 𝐴 ∈ Sℋ ) | |
| 10 | 2, 9 | syl 18 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ Sℋ ) |
| 11 | shocsh 31636 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Sℋ → (⊥‘𝐴) ∈ Sℋ ) | |
| 12 | 10, 11 | syl 18 | . . . . . . . . 9 ⊢ (𝜑 → (⊥‘𝐴) ∈ Sℋ ) |
| 13 | chscl.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ⊆ (⊥‘𝐴)) | |
| 14 | shless 31711 | . . . . . . . . 9 ⊢ (((𝐵 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ∧ 𝐴 ∈ Sℋ ) ∧ 𝐵 ⊆ (⊥‘𝐴)) → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) | |
| 15 | 8, 12, 10, 13, 14 | syl31anc 1400 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) |
| 16 | shscom 31671 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) | |
| 17 | 10, 8, 16 | syl2anc 595 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
| 18 | shscom 31671 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ) → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) | |
| 19 | 10, 12, 18 | syl2anc 595 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) |
| 20 | 15, 17, 19 | 3sstr4d 3992 | . . . . . . 7 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) ⊆ (𝐴 +ℋ (⊥‘𝐴))) |
| 21 | 20 | sselda 3937 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 22 | 5, 21 | syldan 602 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 23 | pjpreeq 31750 | . . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) ↔ (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥)))) | |
| 24 | 3, 22, 23 | syl2anc 595 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) ↔ (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥)))) |
| 25 | 1, 24 | mpbii 236 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥))) |
| 26 | 25 | simpld 499 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴) |
| 27 | chscl.6 | . 2 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((projℎ‘𝐴)‘(𝐻‘𝑛))) | |
| 28 | 26, 27 | fmptd 7109 | 1 ⊢ (𝜑 → 𝐹:ℕ⟶𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 209 ∧ wa 400 = wceq 1570 ∈ wcel 2143 ∃wrex 3089 ⊆ wss 3905 class class class wbr 5109 ↦ cmpt 5192 ⟶wf 6532 ‘cfv 6536 (class class class)co 7410 ℕcn 12228 +ℎ cva 31272 ⇝𝑣 chli 31279 Sℋ csh 31280 Cℋ cch 31281 ⊥cort 31282 +ℋ cph 31283 projℎcpjh 31289 |
| 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-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-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-his2 31435 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-nul 4287 df-if 4488 df-pw 4564 df-sn 4590 df-pr 4592 df-op 4596 df-uni 4873 df-iun 4958 df-br 5110 df-opab 5174 df-mpt 5193 df-id 5556 df-po 5569 df-so 5570 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-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-er 8690 df-en 8940 df-dom 8941 df-sdom 8942 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-grpo 30845 df-ablo 30897 df-hvsub 31323 df-sh 31559 df-ch 31573 df-oc 31604 df-ch0 31605 df-shs 31660 df-pjh 31747 |
| This theorem is referenced by: chscllem2 31990 chscllem3 31991 chscllem4 31992 |
| Copyright terms: Public domain | W3C validator |