| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > chscllem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for chscl 31712. (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 2736 | . . . 4 ⊢ ((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) | |
| 2 | chscl.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Cℋ ) | |
| 3 | 2 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ Cℋ ) |
| 4 | chscl.4 | . . . . . . 7 ⊢ (𝜑 → 𝐻:ℕ⟶(𝐴 +ℋ 𝐵)) | |
| 5 | 4 | ffvelcdmda 7036 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) |
| 6 | chscl.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ Cℋ ) | |
| 7 | chsh 31295 | . . . . . . . . . 10 ⊢ (𝐵 ∈ Cℋ → 𝐵 ∈ Sℋ ) | |
| 8 | 6, 7 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Sℋ ) |
| 9 | chsh 31295 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ Cℋ → 𝐴 ∈ Sℋ ) | |
| 10 | 2, 9 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ Sℋ ) |
| 11 | shocsh 31355 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Sℋ → (⊥‘𝐴) ∈ Sℋ ) | |
| 12 | 10, 11 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → (⊥‘𝐴) ∈ Sℋ ) |
| 13 | chscl.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ⊆ (⊥‘𝐴)) | |
| 14 | shless 31430 | . . . . . . . . 9 ⊢ (((𝐵 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ∧ 𝐴 ∈ Sℋ ) ∧ 𝐵 ⊆ (⊥‘𝐴)) → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) | |
| 15 | 8, 12, 10, 13, 14 | syl31anc 1376 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) |
| 16 | shscom 31390 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) | |
| 17 | 10, 8, 16 | syl2anc 585 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
| 18 | shscom 31390 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ) → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) | |
| 19 | 10, 12, 18 | syl2anc 585 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) |
| 20 | 15, 17, 19 | 3sstr4d 3977 | . . . . . . 7 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) ⊆ (𝐴 +ℋ (⊥‘𝐴))) |
| 21 | 20 | sselda 3921 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 22 | 5, 21 | syldan 592 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 23 | pjpreeq 31469 | . . . . 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 7066 | 1 ⊢ (𝜑 → 𝐹:ℕ⟶𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∃wrex 3061 ⊆ wss 3889 class class class wbr 5085 ↦ cmpt 5166 ⟶wf 6494 ‘cfv 6498 (class class class)co 7367 ℕcn 12174 +ℎ cva 30991 ⇝𝑣 chli 30998 Sℋ csh 30999 Cℋ cch 31000 ⊥cort 31001 +ℋ cph 31002 projℎcpjh 31008 |
| 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 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 ax-hilex 31070 ax-hfvadd 31071 ax-hvcom 31072 ax-hvass 31073 ax-hv0cl 31074 ax-hvaddid 31075 ax-hfvmul 31076 ax-hvmulid 31077 ax-hvmulass 31078 ax-hvdistr1 31079 ax-hvdistr2 31080 ax-hvmul0 31081 ax-hfi 31150 ax-his2 31154 ax-his3 31155 ax-his4 31156 |
| 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 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-id 5526 df-po 5539 df-so 5540 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-er 8643 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-div 11808 df-grpo 30564 df-ablo 30616 df-hvsub 31042 df-sh 31278 df-ch 31292 df-oc 31323 df-ch0 31324 df-shs 31379 df-pjh 31466 |
| This theorem is referenced by: chscllem2 31709 chscllem3 31710 chscllem4 31711 |
| Copyright terms: Public domain | W3C validator |