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 3449 | . 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
2 | cssval.c | . . 3 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
3 | fveq2 6771 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊)) | |
4 | cssval.o | . . . . . . . 8 ⊢ ⊥ = (ocv‘𝑊) | |
5 | 3, 4 | eqtr4di 2798 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = ⊥ ) |
6 | 5 | fveq1d 6773 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( ⊥ ‘𝑠)) |
7 | 5, 6 | fveq12d 6778 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠))) |
8 | 7 | eqeq2d 2751 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)))) |
9 | 8 | abbidv 2809 | . . . 4 ⊢ (𝑤 = 𝑊 → {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
10 | df-css 20867 | . . . 4 ⊢ ClSubSp = (𝑤 ∈ V ↦ {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))}) | |
11 | fvex 6784 | . . . . . 6 ⊢ (Base‘𝑊) ∈ V | |
12 | 11 | pwex 5307 | . . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V |
13 | id 22 | . . . . . . 7 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))) | |
14 | eqid 2740 | . . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | 14, 4 | ocvss 20873 | . . . . . . . 8 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊) |
16 | fvex 6784 | . . . . . . . . 9 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ V | |
17 | 16 | elpw 4543 | . . . . . . . 8 ⊢ (( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊)) |
18 | 15, 17 | mpbir 230 | . . . . . . 7 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) |
19 | 13, 18 | eqeltrdi 2849 | . . . . . 6 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊)) |
20 | 19 | abssi 4008 | . . . . 5 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ⊆ 𝒫 (Base‘𝑊) |
21 | 12, 20 | ssexi 5250 | . . . 4 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ∈ V |
22 | 9, 10, 21 | fvmpt 6872 | . . 3 ⊢ (𝑊 ∈ V → (ClSubSp‘𝑊) = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
23 | 2, 22 | eqtrid 2792 | . 2 ⊢ (𝑊 ∈ V → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
24 | 1, 23 | syl 17 | 1 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1542 ∈ wcel 2110 {cab 2717 Vcvv 3431 ⊆ wss 3892 𝒫 cpw 4539 ‘cfv 6432 Basecbs 16910 ocvcocv 20863 ClSubSpccss 20864 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1802 ax-4 1816 ax-5 1917 ax-6 1975 ax-7 2015 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2158 ax-12 2175 ax-ext 2711 ax-sep 5227 ax-nul 5234 ax-pow 5292 ax-pr 5356 ax-un 7582 |
This theorem depends on definitions: df-bi 206 df-an 397 df-or 845 df-3an 1088 df-tru 1545 df-fal 1555 df-ex 1787 df-nf 1791 df-sb 2072 df-mo 2542 df-eu 2571 df-clab 2718 df-cleq 2732 df-clel 2818 df-nfc 2891 df-ral 3071 df-rex 3072 df-rab 3075 df-v 3433 df-dif 3895 df-un 3897 df-in 3899 df-ss 3909 df-nul 4263 df-if 4466 df-pw 4541 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4846 df-br 5080 df-opab 5142 df-mpt 5163 df-id 5490 df-xp 5596 df-rel 5597 df-cnv 5598 df-co 5599 df-dm 5600 df-rn 5601 df-res 5602 df-ima 5603 df-iota 6390 df-fun 6434 df-fn 6435 df-f 6436 df-fv 6440 df-ov 7274 df-ocv 20866 df-css 20867 |
This theorem is referenced by: iscss 20886 |
Copyright terms: Public domain | W3C validator |