| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > iscss2 | Structured version Visualization version GIF version | ||
| Description: It is sufficient to prove that the double orthocomplement is a subset of the target set to show that the set is a closed subspace. (Contributed by Mario Carneiro, 13-Oct-2015.) |
| Ref | Expression |
|---|---|
| cssss.v | ⊢ 𝑉 = (Base‘𝑊) |
| cssss.c | ⊢ 𝐶 = (ClSubSp‘𝑊) |
| ocvcss.o | ⊢ ⊥ = (ocv‘𝑊) |
| Ref | Expression |
|---|---|
| iscss2 | ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝑆 ∈ 𝐶 ↔ ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ 𝑆)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | ocvcss.o | . . . 4 ⊢ ⊥ = (ocv‘𝑊) | |
| 2 | cssss.c | . . . 4 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
| 3 | 1, 2 | iscss 21995 | . . 3 ⊢ (𝑊 ∈ PreHil → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
| 4 | 3 | adantr 486 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝑆 ∈ 𝐶 ↔ 𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)))) |
| 5 | cssss.v | . . . 4 ⊢ 𝑉 = (Base‘𝑊) | |
| 6 | 5, 1 | ocvocv 21983 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ ( ⊥ ‘( ⊥ ‘𝑆))) |
| 7 | eqss 3923 | . . . 4 ⊢ (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) ↔ (𝑆 ⊆ ( ⊥ ‘( ⊥ ‘𝑆)) ∧ ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ 𝑆)) | |
| 8 | 7 | baib 545 | . . 3 ⊢ (𝑆 ⊆ ( ⊥ ‘( ⊥ ‘𝑆)) → (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) ↔ ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ 𝑆)) |
| 9 | 6, 8 | syl 18 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝑆 = ( ⊥ ‘( ⊥ ‘𝑆)) ↔ ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ 𝑆)) |
| 10 | 4, 9 | bitrd 282 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝑆 ∈ 𝐶 ↔ ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ 𝑆)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ⊆ wss 3895 ‘cfv 6539 Basecbs 17393 PreHilcphl 21936 ocvcocv 21972 ClSubSpccss 21973 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5326 ax-pr 5390 ax-un 7752 ax-cnex 11260 ax-resscn 11261 ax-1cn 11262 ax-icn 11263 ax-addcl 11264 ax-addrcl 11265 ax-mulcl 11266 ax-mulrcl 11267 ax-mulcom 11268 ax-addass 11269 ax-mulass 11270 ax-distr 11271 ax-i2m1 11272 ax-1ne0 11273 ax-1rid 11274 ax-rnegex 11275 ax-rrecex 11276 ax-cnre 11277 ax-pre-lttri 11278 ax-pre-lttrn 11279 ax-pre-ltadd 11280 ax-pre-mulgt0 11281 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 df-mo 2564 df-eu 2594 df-clab 2739 df-cleq 2752 df-clel 2835 df-nfc 2909 df-ne 2956 df-nel 3062 df-ral 3077 df-rex 3087 df-rmo 3365 df-reu 3366 df-rab 3413 df-v 3452 df-sbc 3739 df-csb 3847 df-ss 3896 df-pss 4014 df-dif 4047 df-in 4091 df-un 4151 df-nul 4279 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5545 df-eprel 5550 df-po 5558 df-so 5559 df-fr 5603 df-we 5605 df-xp 5656 df-rel 5657 df-cnv 5658 df-co 5659 df-dm 5660 df-rn 5661 df-res 5662 df-ima 5663 df-pred 6304 df-ord 6365 df-on 6366 df-lim 6367 df-suc 6368 df-iota 6494 df-fun 6541 df-fn 6542 df-f 6543 df-f1 6544 df-fo 6545 df-f1o 6546 df-fv 6547 df-riota 7378 df-ov 7424 df-oprab 7425 df-mpo 7426 df-om 7879 df-1st 8002 df-2nd 8003 df-tpos 8247 df-frecs 8303 df-wrecs 8334 df-recs 8383 df-rdg 8422 df-er 8721 df-map 8853 df-en 8978 df-dom 8979 df-sdom 8980 df-pnf 11349 df-mnf 11350 df-xr 11351 df-ltxr 11352 df-le 11353 df-sub 11547 df-neg 11548 df-nn 12340 df-2 12409 df-3 12410 df-4 12411 df-5 12412 df-6 12413 df-7 12414 df-8 12415 df-sets 17348 df-slot 17366 df-ndx 17378 df-base 17394 df-plusg 17447 df-mulr 17448 df-sca 17450 df-vsca 17451 df-ip 17452 df-0g 17618 df-mgm 18822 df-sgrp 18914 df-mnd 18930 df-mhm 18984 df-grp 19153 df-ghm 19434 df-mgp 20367 df-ur 20414 df-ring 20467 df-oppr 20573 df-rhm 20708 df-staf 21102 df-srng 21103 df-lmod 21143 df-lmhm 21303 df-lvec 21384 df-sra 21454 df-rgmod 21455 df-phl 21938 df-ocv 21975 df-css 21976 |
| This theorem is used by: ocvcss 21999 lsmcss 22004 cssmre 22005 |
| Copyright terms: Public domain | W3C validator |