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 | ⊢ 𝐶 = (CSubSp‘𝑊) |
Ref | Expression |
---|---|
cssval | ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | elex 3185 | . 2 ⊢ (𝑊 ∈ 𝑋 → 𝑊 ∈ V) | |
2 | cssval.c | . . 3 ⊢ 𝐶 = (CSubSp‘𝑊) | |
3 | fveq2 6103 | . . . . . . . 8 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = (ocv‘𝑊)) | |
4 | cssval.o | . . . . . . . 8 ⊢ ⊥ = (ocv‘𝑊) | |
5 | 3, 4 | syl6eqr 2662 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → (ocv‘𝑤) = ⊥ ) |
6 | 5 | fveq1d 6105 | . . . . . . 7 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘𝑠) = ( ⊥ ‘𝑠)) |
7 | 5, 6 | fveq12d 6109 | . . . . . 6 ⊢ (𝑤 = 𝑊 → ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑠))) |
8 | 7 | eqeq2d 2620 | . . . . 5 ⊢ (𝑤 = 𝑊 → (𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠)) ↔ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)))) |
9 | 8 | abbidv 2728 | . . . 4 ⊢ (𝑤 = 𝑊 → {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))} = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
10 | df-css 19827 | . . . 4 ⊢ CSubSp = (𝑤 ∈ V ↦ {𝑠 ∣ 𝑠 = ((ocv‘𝑤)‘((ocv‘𝑤)‘𝑠))}) | |
11 | fvex 6113 | . . . . . 6 ⊢ (Base‘𝑊) ∈ V | |
12 | 11 | pwex 4774 | . . . . 5 ⊢ 𝒫 (Base‘𝑊) ∈ V |
13 | id 22 | . . . . . . 7 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))) | |
14 | eqid 2610 | . . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
15 | 14, 4 | ocvss 19833 | . . . . . . . 8 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊) |
16 | fvex 6113 | . . . . . . . . 9 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ V | |
17 | 16 | elpw 4114 | . . . . . . . 8 ⊢ (( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) ↔ ( ⊥ ‘( ⊥ ‘𝑠)) ⊆ (Base‘𝑊)) |
18 | 15, 17 | mpbir 220 | . . . . . . 7 ⊢ ( ⊥ ‘( ⊥ ‘𝑠)) ∈ 𝒫 (Base‘𝑊) |
19 | 13, 18 | syl6eqel 2696 | . . . . . 6 ⊢ (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) → 𝑠 ∈ 𝒫 (Base‘𝑊)) |
20 | 19 | abssi 3640 | . . . . 5 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ⊆ 𝒫 (Base‘𝑊) |
21 | 12, 20 | ssexi 4731 | . . . 4 ⊢ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ∈ V |
22 | 9, 10, 21 | fvmpt 6191 | . . 3 ⊢ (𝑊 ∈ V → (CSubSp‘𝑊) = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
23 | 2, 22 | syl5eq 2656 | . 2 ⊢ (𝑊 ∈ V → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
24 | 1, 23 | syl 17 | 1 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 = wceq 1475 ∈ wcel 1977 {cab 2596 Vcvv 3173 ⊆ wss 3540 𝒫 cpw 4108 ‘cfv 5804 Basecbs 15695 ocvcocv 19823 CSubSpccss 19824 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-ral 2901 df-rex 2902 df-rab 2905 df-v 3175 df-sbc 3403 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-op 4132 df-uni 4373 df-br 4584 df-opab 4644 df-mpt 4645 df-id 4953 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-fv 5812 df-ov 6552 df-ocv 19826 df-css 19827 |
This theorem is referenced by: iscss 19846 |
Copyright terms: Public domain | W3C validator |