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 20820 | . . 3 ⊢ (𝑊 ∈ 𝑋 → 𝐶 = {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))}) |
4 | 3 | eleq2d 2898 | . 2 ⊢ (𝑊 ∈ 𝑋 → (𝑆 ∈ 𝐶 ↔ 𝑆 ∈ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))})) |
5 | id 22 | . . . 4 ⊢ (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) → 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))) | |
6 | fvex 6678 | . . . 4 ⊢ ( ⊥ ‘( ⊥ ‘𝑆)) ∈ V | |
7 | 5, 6 | eqeltrdi 2921 | . . 3 ⊢ (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) → 𝑆 ∈ V) |
8 | id 22 | . . . 4 ⊢ (𝑠 = 𝑆 → 𝑠 = 𝑆) | |
9 | 2fveq3 6670 | . . . 4 ⊢ (𝑠 = 𝑆 → ( ⊥ ‘( ⊥ ‘𝑠)) = ( ⊥ ‘( ⊥ ‘𝑆))) | |
10 | 8, 9 | eqeq12d 2837 | . . 3 ⊢ (𝑠 = 𝑆 → (𝑠 = ( ⊥ ‘( ⊥ ‘𝑠)) ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
11 | 7, 10 | elab3 3674 | . 2 ⊢ (𝑆 ∈ {𝑠 ∣ 𝑠 = ( ⊥ ‘( ⊥ ‘𝑠))} ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆))) |
12 | 4, 11 | syl6bb 289 | 1 ⊢ (𝑊 ∈ 𝑋 → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 = wceq 1533 ∈ wcel 2110 {cab 2799 Vcvv 3495 ‘cfv 6350 ocvcocv 20798 ClSubSpccss 20799 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1792 ax-4 1806 ax-5 1907 ax-6 1966 ax-7 2011 ax-8 2112 ax-9 2120 ax-10 2141 ax-11 2156 ax-12 2172 ax-ext 2793 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5322 ax-un 7455 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3an 1085 df-tru 1536 df-ex 1777 df-nf 1781 df-sb 2066 df-mo 2618 df-eu 2650 df-clab 2800 df-cleq 2814 df-clel 2893 df-nfc 2963 df-ne 3017 df-ral 3143 df-rex 3144 df-rab 3147 df-v 3497 df-sbc 3773 df-dif 3939 df-un 3941 df-in 3943 df-ss 3952 df-nul 4292 df-if 4468 df-pw 4541 df-sn 4562 df-pr 4564 df-op 4568 df-uni 4833 df-br 5060 df-opab 5122 df-mpt 5140 df-id 5455 df-xp 5556 df-rel 5557 df-cnv 5558 df-co 5559 df-dm 5560 df-rn 5561 df-res 5562 df-ima 5563 df-iota 6309 df-fun 6352 df-fn 6353 df-f 6354 df-fv 6358 df-ov 7153 df-ocv 20801 df-css 20802 |
This theorem is referenced by: cssi 20822 iscss2 20824 obslbs 20868 hlhillcs 39088 |
Copyright terms: Public domain | W3C validator |