Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > cssval | Structured version Visualization version GIF version |
Description: The set of closed subspaces of a pre-Hilbert space. (Contributed by NM, 7-Oct-2011.) (Revised by Mario Carneiro, 13-Oct-2015.) |
Ref | Expression |
---|---|
cssval.o | ⊢ ⊥ = (ocv‘𝑊) |
cssval.c | ⊢ 𝐶 = (ClSubSp‘𝑊) |
Ref | Expression |
---|---|
cssval | ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3510 | . 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
2 | cssval.c | . . 3 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
3 | fveq2 6663 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊)) | |
4 | cssval.o | . . . . . . . 8 ⊢ ⊥ = (ocv‘𝑊) | |
5 | 3, 4 | syl6eqr 2871 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = ⊥ ) |
6 | 5 | fveq1d 6665 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( ⊥ ‘𝑠)) |
7 | 5, 6 | fveq12d 6670 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠))) |
8 | 7 | eqeq2d 2829 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)))) |
9 | 8 | abbidv 2882 | . . . 4 ⊢ (𝑤 = 𝑊 → {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
10 | df-css 20736 | . . . 4 ⊢ ClSubSp = (𝑤 ∈ V ↦ {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))}) | |
11 | fvex 6676 | . . . . . 6 ⊢ (Base‘𝑊) ∈ V | |
12 | 11 | pwex 5272 | . . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V |
13 | id 22 | . . . . . . 7 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))) | |
14 | eqid 2818 | . . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | 14, 4 | ocvss 20742 | . . . . . . . 8 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊) |
16 | fvex 6676 | . . . . . . . . 9 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ V | |
17 | 16 | elpw 4542 | . . . . . . . 8 ⊢ (( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊)) |
18 | 15, 17 | mpbir 232 | . . . . . . 7 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) |
19 | 13, 18 | syl6eqel 2918 | . . . . . 6 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊)) |
20 | 19 | abssi 4043 | . . . . 5 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ⊆ 𝒫 (Base‘𝑊) |
21 | 12, 20 | ssexi 5217 | . . . 4 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ∈ V |
22 | 9, 10, 21 | fvmpt 6761 | . . 3 ⊢ (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
23 | 2, 22 | syl5eq 2865 | . 2 ⊢ (𝑊 ∈ V → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
24 | 1, 23 | syl 17 | 1 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1528 ∈ wcel 2105 {cab 2796 Vcvv 3492 ⊆ wss 3933 𝒫 cpw 4535 ‘cfv 6348 Basecbs 16471 ocvcocv 20732 ClSubSpccss 20733 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1787 ax-4 1801 ax-5 1902 ax-6 1961 ax-7 2006 ax-8 2107 ax-9 2115 ax-10 2136 ax-11 2151 ax-12 2167 ax-ext 2790 ax-sep 5194 ax-nul 5201 ax-pow 5257 ax-pr 5320 ax-un 7450 |
This theorem depends on definitions: df-bi 208 df-an 397 df-or 842 df-3an 1081 df-tru 1531 df-ex 1772 df-nf 1776 df-sb 2061 df-mo 2615 df-eu 2647 df-clab 2797 df-cleq 2811 df-clel 2890 df-nfc 2960 df-ne 3014 df-ral 3140 df-rex 3141 df-rab 3144 df-v 3494 df-sbc 3770 df-dif 3936 df-un 3938 df-in 3940 df-ss 3949 df-nul 4289 df-if 4464 df-pw 4537 df-sn 4558 df-pr 4560 df-op 4564 df-uni 4831 df-br 5058 df-opab 5120 df-mpt 5138 df-id 5453 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-fv 6356 df-ov 7148 df-ocv 20735 df-css 20736 |
This theorem is referenced by: iscss 20755 |
Copyright terms: Public domain | W3C validator |