| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > mrccss | Structured version Visualization version GIF version | ||
| Description: The Moore closure corresponding to the system of closed subspaces is the double orthocomplement operation. (Contributed by Mario Carneiro, 13-Oct-2015.) |
| Ref | Expression |
|---|---|
| mrccss.v | ⊢ 𝑉 = (Base‘𝑊) |
| mrccss.o | ⊢ ⊥ = (ocv‘𝑊) |
| mrccss.c | ⊢ 𝐶 = (ClSubSp‘𝑊) |
| mrccss.f | ⊢ 𝐹 = (mrCls‘𝐶) |
| Ref | Expression |
|---|---|
| mrccss | ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) = ( ⊥ ‘( ⊥ ‘𝑆))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | mrccss.v | . . . . 5 ⊢ 𝑉 = (Base‘𝑊) | |
| 2 | mrccss.c | . . . . 5 ⊢ 𝐶 = (ClSubSp‘𝑊) | |
| 3 | 1, 2 | cssmre 21906 | . . . 4 ⊢ (𝑊 ∈ PreHil → 𝐶 ∈ (Moore‘𝑉)) |
| 4 | 3 | adantr 486 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → 𝐶 ∈ (Moore‘𝑉)) |
| 5 | mrccss.o | . . . 4 ⊢ ⊥ = (ocv‘𝑊) | |
| 6 | 1, 5 | ocvocv 21884 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ ( ⊥ ‘( ⊥ ‘𝑆))) |
| 7 | 1, 5 | ocvss 21883 | . . . . 5 ⊢ ( ⊥ ‘𝑆) ⊆ 𝑉 |
| 8 | 7 | a1i 11 | . . . 4 ⊢ (𝑆 ⊆ 𝑉 → ( ⊥ ‘𝑆) ⊆ 𝑉) |
| 9 | 1, 2, 5 | ocvcss 21900 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ ( ⊥ ‘𝑆) ⊆ 𝑉) → ( ⊥ ‘( ⊥ ‘𝑆)) ∈ 𝐶) |
| 10 | 8, 9 | sylan2 605 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → ( ⊥ ‘( ⊥ ‘𝑆)) ∈ 𝐶) |
| 11 | mrccss.f | . . . 4 ⊢ 𝐹 = (mrCls‘𝐶) | |
| 12 | 11 | mrcsscl 17708 | . . 3 ⊢ ((𝐶 ∈ (Moore‘𝑉) ∧ 𝑆 ⊆ ( ⊥ ‘( ⊥ ‘𝑆)) ∧ ( ⊥ ‘( ⊥ ‘𝑆)) ∈ 𝐶) → (𝐹‘𝑆) ⊆ ( ⊥ ‘( ⊥ ‘𝑆))) |
| 13 | 4, 6, 10, 12 | syl3anc 1398 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) ⊆ ( ⊥ ‘( ⊥ ‘𝑆))) |
| 14 | 11 | mrcssid 17705 | . . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑉) ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ (𝐹‘𝑆)) |
| 15 | 3, 14 | sylan 592 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → 𝑆 ⊆ (𝐹‘𝑆)) |
| 16 | 5 | ocv2ss 21886 | . . . 4 ⊢ (𝑆 ⊆ (𝐹‘𝑆) → ( ⊥ ‘(𝐹‘𝑆)) ⊆ ( ⊥ ‘𝑆)) |
| 17 | 5 | ocv2ss 21886 | . . . 4 ⊢ (( ⊥ ‘(𝐹‘𝑆)) ⊆ ( ⊥ ‘𝑆) → ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ ( ⊥ ‘( ⊥ ‘(𝐹‘𝑆)))) |
| 18 | 15, 16, 17 | 3syl 19 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ ( ⊥ ‘( ⊥ ‘(𝐹‘𝑆)))) |
| 19 | 11 | mrccl 17699 | . . . . 5 ⊢ ((𝐶 ∈ (Moore‘𝑉) ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) ∈ 𝐶) |
| 20 | 3, 19 | sylan 592 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) ∈ 𝐶) |
| 21 | 5, 2 | cssi 21897 | . . . 4 ⊢ ((𝐹‘𝑆) ∈ 𝐶 → (𝐹‘𝑆) = ( ⊥ ‘( ⊥ ‘(𝐹‘𝑆)))) |
| 22 | 20, 21 | syl 18 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) = ( ⊥ ‘( ⊥ ‘(𝐹‘𝑆)))) |
| 23 | 18, 22 | sseqtrrd 3968 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → ( ⊥ ‘( ⊥ ‘𝑆)) ⊆ (𝐹‘𝑆)) |
| 24 | 13, 23 | eqssd 3948 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ 𝑉) → (𝐹‘𝑆) = ( ⊥ ‘( ⊥ ‘𝑆))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ∧ wa 401 = wceq 1570 ∈ wcel 2145 ⊆ wss 3899 ‘cfv 6533 Basecbs 17301 Moorecmre 17666 mrClscmrc 17667 PreHilcphl 21837 ocvcocv 21873 ClSubSpccss 21874 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-tpos 8224 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-map 8828 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-0g 17526 df-mre 17670 df-mrc 17671 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-mhm 18891 df-grp 19060 df-ghm 19341 df-mgp 20274 df-ur 20321 df-ring 20374 df-oppr 20478 df-rhm 20613 df-staf 21005 df-srng 21006 df-lmod 21046 df-lmhm 21206 df-lvec 21287 df-sra 21357 df-rgmod 21358 df-phl 21839 df-ocv 21876 df-css 21877 |
| This theorem is used by: (None) |
| Copyright terms: Public domain | W3C validator |