| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > chscllem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for chscl 31701. (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 2737 | . . . 4 ⊢ ((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) | |
| 2 | chscl.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Cℋ ) | |
| 3 | 2 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ Cℋ ) |
| 4 | chscl.4 | . . . . . . 7 ⊢ (𝜑 → 𝐻:ℕ⟶(𝐴 +ℋ 𝐵)) | |
| 5 | 4 | ffvelcdmda 7028 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) |
| 6 | chscl.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ Cℋ ) | |
| 7 | chsh 31284 | . . . . . . . . . 10 ⊢ (𝐵 ∈ Cℋ → 𝐵 ∈ Sℋ ) | |
| 8 | 6, 7 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Sℋ ) |
| 9 | chsh 31284 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ Cℋ → 𝐴 ∈ Sℋ ) | |
| 10 | 2, 9 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ Sℋ ) |
| 11 | shocsh 31344 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Sℋ → (⊥‘𝐴) ∈ Sℋ ) | |
| 12 | 10, 11 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → (⊥‘𝐴) ∈ Sℋ ) |
| 13 | chscl.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ⊆ (⊥‘𝐴)) | |
| 14 | shless 31419 | . . . . . . . . 9 ⊢ (((𝐵 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ∧ 𝐴 ∈ Sℋ ) ∧ 𝐵 ⊆ (⊥‘𝐴)) → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) | |
| 15 | 8, 12, 10, 13, 14 | syl31anc 1376 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) |
| 16 | shscom 31379 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) | |
| 17 | 10, 8, 16 | syl2anc 585 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
| 18 | shscom 31379 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ) → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) | |
| 19 | 10, 12, 18 | syl2anc 585 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) |
| 20 | 15, 17, 19 | 3sstr4d 3978 | . . . . . . 7 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) ⊆ (𝐴 +ℋ (⊥‘𝐴))) |
| 21 | 20 | sselda 3922 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 22 | 5, 21 | syldan 592 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 23 | pjpreeq 31458 | . . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) ↔ (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥)))) | |
| 24 | 3, 22, 23 | syl2anc 585 | . . . 4 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) ↔ (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥)))) |
| 25 | 1, 24 | mpbii 233 | . . 3 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥))) |
| 26 | 25 | simpld 494 | . 2 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → ((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴) |
| 27 | chscl.6 | . 2 ⊢ 𝐹 = (𝑛 ∈ ℕ ↦ ((projℎ‘𝐴)‘(𝐻‘𝑛))) | |
| 28 | 26, 27 | fmptd 7058 | 1 ⊢ (𝜑 → 𝐹:ℕ⟶𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3062 ⊆ wss 3890 class class class wbr 5086 ↦ cmpt 5167 ⟶wf 6486 ‘cfv 6490 (class class class)co 7358 ℕcn 12146 +ℎ cva 30980 ⇝𝑣 chli 30987 Sℋ csh 30988 Cℋ cch 30989 ⊥cort 30990 +ℋ cph 30991 projℎcpjh 30997 |
| 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 2709 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5300 ax-pr 5368 ax-un 7680 ax-resscn 11084 ax-1cn 11085 ax-icn 11086 ax-addcl 11087 ax-addrcl 11088 ax-mulcl 11089 ax-mulrcl 11090 ax-mulcom 11091 ax-addass 11092 ax-mulass 11093 ax-distr 11094 ax-i2m1 11095 ax-1ne0 11096 ax-1rid 11097 ax-rnegex 11098 ax-rrecex 11099 ax-cnre 11100 ax-pre-lttri 11101 ax-pre-lttrn 11102 ax-pre-ltadd 11103 ax-pre-mulgt0 11104 ax-hilex 31059 ax-hfvadd 31060 ax-hvcom 31061 ax-hvass 31062 ax-hv0cl 31063 ax-hvaddid 31064 ax-hfvmul 31065 ax-hvmulid 31066 ax-hvmulass 31067 ax-hvdistr1 31068 ax-hvdistr2 31069 ax-hvmul0 31070 ax-hfi 31139 ax-his2 31143 ax-his3 31144 ax-his4 31145 |
| 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 2540 df-eu 2570 df-clab 2716 df-cleq 2729 df-clel 2812 df-nfc 2886 df-ne 2934 df-nel 3038 df-ral 3053 df-rex 3063 df-rmo 3343 df-reu 3344 df-rab 3391 df-v 3432 df-sbc 3730 df-csb 3839 df-dif 3893 df-un 3895 df-in 3897 df-ss 3907 df-nul 4275 df-if 4468 df-pw 4544 df-sn 4569 df-pr 4571 df-op 4575 df-uni 4852 df-iun 4936 df-br 5087 df-opab 5149 df-mpt 5168 df-id 5517 df-po 5530 df-so 5531 df-xp 5628 df-rel 5629 df-cnv 5630 df-co 5631 df-dm 5632 df-rn 5633 df-res 5634 df-ima 5635 df-iota 6446 df-fun 6492 df-fn 6493 df-f 6494 df-f1 6495 df-fo 6496 df-f1o 6497 df-fv 6498 df-riota 7315 df-ov 7361 df-oprab 7362 df-mpo 7363 df-er 8634 df-en 8885 df-dom 8886 df-sdom 8887 df-pnf 11169 df-mnf 11170 df-xr 11171 df-ltxr 11172 df-le 11173 df-sub 11367 df-neg 11368 df-div 11796 df-grpo 30553 df-ablo 30605 df-hvsub 31031 df-sh 31267 df-ch 31281 df-oc 31312 df-ch0 31313 df-shs 31368 df-pjh 31455 |
| This theorem is referenced by: chscllem2 31698 chscllem3 31699 chscllem4 31700 |
| Copyright terms: Public domain | W3C validator |