| Hilbert Space Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > HSE Home > Th. List > chscllem1 | Structured version Visualization version GIF version | ||
| Description: Lemma for chscl 31577. (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 2730 | . . . 4 ⊢ ((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) | |
| 2 | chscl.1 | . . . . . 6 ⊢ (𝜑 → 𝐴 ∈ Cℋ ) | |
| 3 | 2 | adantr 480 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → 𝐴 ∈ Cℋ ) |
| 4 | chscl.4 | . . . . . . 7 ⊢ (𝜑 → 𝐻:ℕ⟶(𝐴 +ℋ 𝐵)) | |
| 5 | 4 | ffvelcdmda 7059 | . . . . . 6 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) |
| 6 | chscl.2 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐵 ∈ Cℋ ) | |
| 7 | chsh 31160 | . . . . . . . . . 10 ⊢ (𝐵 ∈ Cℋ → 𝐵 ∈ Sℋ ) | |
| 8 | 6, 7 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ∈ Sℋ ) |
| 9 | chsh 31160 | . . . . . . . . . . 11 ⊢ (𝐴 ∈ Cℋ → 𝐴 ∈ Sℋ ) | |
| 10 | 2, 9 | syl 17 | . . . . . . . . . 10 ⊢ (𝜑 → 𝐴 ∈ Sℋ ) |
| 11 | shocsh 31220 | . . . . . . . . . 10 ⊢ (𝐴 ∈ Sℋ → (⊥‘𝐴) ∈ Sℋ ) | |
| 12 | 10, 11 | syl 17 | . . . . . . . . 9 ⊢ (𝜑 → (⊥‘𝐴) ∈ Sℋ ) |
| 13 | chscl.3 | . . . . . . . . 9 ⊢ (𝜑 → 𝐵 ⊆ (⊥‘𝐴)) | |
| 14 | shless 31295 | . . . . . . . . 9 ⊢ (((𝐵 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ∧ 𝐴 ∈ Sℋ ) ∧ 𝐵 ⊆ (⊥‘𝐴)) → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) | |
| 15 | 8, 12, 10, 13, 14 | syl31anc 1375 | . . . . . . . 8 ⊢ (𝜑 → (𝐵 +ℋ 𝐴) ⊆ ((⊥‘𝐴) +ℋ 𝐴)) |
| 16 | shscom 31255 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ 𝐵 ∈ Sℋ ) → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) | |
| 17 | 10, 8, 16 | syl2anc 584 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) = (𝐵 +ℋ 𝐴)) |
| 18 | shscom 31255 | . . . . . . . . 9 ⊢ ((𝐴 ∈ Sℋ ∧ (⊥‘𝐴) ∈ Sℋ ) → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) | |
| 19 | 10, 12, 18 | syl2anc 584 | . . . . . . . 8 ⊢ (𝜑 → (𝐴 +ℋ (⊥‘𝐴)) = ((⊥‘𝐴) +ℋ 𝐴)) |
| 20 | 15, 17, 19 | 3sstr4d 4005 | . . . . . . 7 ⊢ (𝜑 → (𝐴 +ℋ 𝐵) ⊆ (𝐴 +ℋ (⊥‘𝐴))) |
| 21 | 20 | sselda 3949 | . . . . . 6 ⊢ ((𝜑 ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ 𝐵)) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 22 | 5, 21 | syldan 591 | . . . . 5 ⊢ ((𝜑 ∧ 𝑛 ∈ ℕ) → (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) |
| 23 | pjpreeq 31334 | . . . . 5 ⊢ ((𝐴 ∈ Cℋ ∧ (𝐻‘𝑛) ∈ (𝐴 +ℋ (⊥‘𝐴))) → (((projℎ‘𝐴)‘(𝐻‘𝑛)) = ((projℎ‘𝐴)‘(𝐻‘𝑛)) ↔ (((projℎ‘𝐴)‘(𝐻‘𝑛)) ∈ 𝐴 ∧ ∃𝑥 ∈ (⊥‘𝐴)(𝐻‘𝑛) = (((projℎ‘𝐴)‘(𝐻‘𝑛)) +ℎ 𝑥)))) | |
| 24 | 3, 22, 23 | syl2anc 584 | . . . 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 7089 | 1 ⊢ (𝜑 → 𝐹:ℕ⟶𝐴) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1540 ∈ wcel 2109 ∃wrex 3054 ⊆ wss 3917 class class class wbr 5110 ↦ cmpt 5191 ⟶wf 6510 ‘cfv 6514 (class class class)co 7390 ℕcn 12193 +ℎ cva 30856 ⇝𝑣 chli 30863 Sℋ csh 30864 Cℋ cch 30865 ⊥cort 30866 +ℋ cph 30867 projℎcpjh 30873 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1967 ax-7 2008 ax-8 2111 ax-9 2119 ax-10 2142 ax-11 2158 ax-12 2178 ax-ext 2702 ax-rep 5237 ax-sep 5254 ax-nul 5264 ax-pow 5323 ax-pr 5390 ax-un 7714 ax-resscn 11132 ax-1cn 11133 ax-icn 11134 ax-addcl 11135 ax-addrcl 11136 ax-mulcl 11137 ax-mulrcl 11138 ax-mulcom 11139 ax-addass 11140 ax-mulass 11141 ax-distr 11142 ax-i2m1 11143 ax-1ne0 11144 ax-1rid 11145 ax-rnegex 11146 ax-rrecex 11147 ax-cnre 11148 ax-pre-lttri 11149 ax-pre-lttrn 11150 ax-pre-ltadd 11151 ax-pre-mulgt0 11152 ax-hilex 30935 ax-hfvadd 30936 ax-hvcom 30937 ax-hvass 30938 ax-hv0cl 30939 ax-hvaddid 30940 ax-hfvmul 30941 ax-hvmulid 30942 ax-hvmulass 30943 ax-hvdistr1 30944 ax-hvdistr2 30945 ax-hvmul0 30946 ax-hfi 31015 ax-his2 31019 ax-his3 31020 ax-his4 31021 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 848 df-3or 1087 df-3an 1088 df-tru 1543 df-fal 1553 df-ex 1780 df-nf 1784 df-sb 2066 df-mo 2534 df-eu 2563 df-clab 2709 df-cleq 2722 df-clel 2804 df-nfc 2879 df-ne 2927 df-nel 3031 df-ral 3046 df-rex 3055 df-rmo 3356 df-reu 3357 df-rab 3409 df-v 3452 df-sbc 3757 df-csb 3866 df-dif 3920 df-un 3922 df-in 3924 df-ss 3934 df-nul 4300 df-if 4492 df-pw 4568 df-sn 4593 df-pr 4595 df-op 4599 df-uni 4875 df-iun 4960 df-br 5111 df-opab 5173 df-mpt 5192 df-id 5536 df-po 5549 df-so 5550 df-xp 5647 df-rel 5648 df-cnv 5649 df-co 5650 df-dm 5651 df-rn 5652 df-res 5653 df-ima 5654 df-iota 6467 df-fun 6516 df-fn 6517 df-f 6518 df-f1 6519 df-fo 6520 df-f1o 6521 df-fv 6522 df-riota 7347 df-ov 7393 df-oprab 7394 df-mpo 7395 df-er 8674 df-en 8922 df-dom 8923 df-sdom 8924 df-pnf 11217 df-mnf 11218 df-xr 11219 df-ltxr 11220 df-le 11221 df-sub 11414 df-neg 11415 df-div 11843 df-grpo 30429 df-ablo 30481 df-hvsub 30907 df-sh 31143 df-ch 31157 df-oc 31188 df-ch0 31189 df-shs 31244 df-pjh 31331 |
| This theorem is referenced by: chscllem2 31574 chscllem3 31575 chscllem4 31576 |
| Copyright terms: Public domain | W3C validator |