Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > iscss | Structured version Visualization version GIF version |
Description: The predicate "is a closed subspace" (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 |
---|---|
iscss | ⊢ (𝑊 ∈ 𝑋 → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | cssval.o | . . . 4 ⊢ ⊥ = (ocv‘𝑊) | |
2 | cssval.c | . . . 4 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
3 | 1, 2 | cssval 20799 | . . 3 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
4 | 3 | eleq2d 2824 | . 2 ⊢ (𝑊 ∈ 𝑋 → (𝑆 ∈ 𝐶 ↔ 𝑆 ∈ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})) |
5 | id 22 | . . . 4 ⊢ (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) → 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))) | |
6 | fvex 6769 | . . . 4 ⊢ ( ⊥ ‘( ⊥ ‘𝑆)) ∈ V | |
7 | 5, 6 | eqeltrdi 2847 | . . 3 ⊢ (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) → 𝑆 ∈ V) |
8 | id 22 | . . . 4 ⊢ (𝑠 = 𝑆 → 𝑠 = 𝑆) | |
9 | 2fveq3 6761 | . . . 4 ⊢ (𝑠 = 𝑆 → ( ⊥ ‘( ⊥ ‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑆))) | |
10 | 8, 9 | eqeq12d 2754 | . . 3 ⊢ (𝑠 = 𝑆 → (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
11 | 7, 10 | elab3 3610 | . 2 ⊢ (𝑆 ∈ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))) |
12 | 4, 11 | bitrdi 286 | 1 ⊢ (𝑊 ∈ 𝑋 → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 205 = wceq 1539 ∈ wcel 2108 {cab 2715 Vcvv 3422 ‘cfv 6418 ocvcocv 20777 ClSubSpccss 20778 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1799 ax-4 1813 ax-5 1914 ax-6 1972 ax-7 2012 ax-8 2110 ax-9 2118 ax-10 2139 ax-11 2156 ax-12 2173 ax-ext 2709 ax-sep 5218 ax-nul 5225 ax-pow 5283 ax-pr 5347 ax-un 7566 |
This theorem depends on definitions: df-bi 206 df-an 396 df-or 844 df-3an 1087 df-tru 1542 df-fal 1552 df-ex 1784 df-nf 1788 df-sb 2069 df-mo 2540 df-eu 2569 df-clab 2716 df-cleq 2730 df-clel 2817 df-nfc 2888 df-ne 2943 df-ral 3068 df-rex 3069 df-rab 3072 df-v 3424 df-dif 3886 df-un 3888 df-in 3890 df-ss 3900 df-nul 4254 df-if 4457 df-pw 4532 df-sn 4559 df-pr 4561 df-op 4565 df-uni 4837 df-br 5071 df-opab 5133 df-mpt 5154 df-id 5480 df-xp 5586 df-rel 5587 df-cnv 5588 df-co 5589 df-dm 5590 df-rn 5591 df-res 5592 df-ima 5593 df-iota 6376 df-fun 6420 df-fn 6421 df-f 6422 df-fv 6426 df-ov 7258 df-ocv 20780 df-css 20781 |
This theorem is referenced by: cssi 20801 iscss2 20803 obslbs 20847 hlhillcs 39903 |
Copyright terms: Public domain | W3C validator |