| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > ocvin | Structured version Visualization version GIF version | ||
| Description: An orthocomplement has trivial intersection with the original subspace. (Contributed by Mario Carneiro, 16-Oct-2015.) |
| Ref | Expression |
|---|---|
| ocv2ss.o | ⊢ ⊥ = (ocv‘𝑊) |
| ocvin.l | ⊢ 𝐿 = (LSubSp‘𝑊) |
| ocvin.z | ⊢ 0 = (0g‘𝑊) |
| Ref | Expression |
|---|---|
| ocvin | ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) = { 0 }) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | eqid 2736 | . . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
| 2 | eqid 2736 | . . . . . . . . 9 ⊢ (·𝑖‘𝑊) = (·𝑖‘𝑊) | |
| 3 | eqid 2736 | . . . . . . . . 9 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
| 4 | eqid 2736 | . . . . . . . . 9 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊)) | |
| 5 | ocv2ss.o | . . . . . . . . 9 ⊢ ⊥ = (ocv‘𝑊) | |
| 6 | 1, 2, 3, 4, 5 | ocvi 21649 | . . . . . . . 8 ⊢ ((𝑥 ∈ ( ⊥ ‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
| 7 | 6 | ancoms 458 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆)) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
| 8 | 7 | adantl 481 | . . . . . 6 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
| 9 | simpll 767 | . . . . . . 7 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑊 ∈ PreHil) | |
| 10 | ocvin.l | . . . . . . . . 9 ⊢ 𝐿 = (LSubSp‘𝑊) | |
| 11 | 1, 10 | lssel 20932 | . . . . . . . 8 ⊢ ((𝑆 ∈ 𝐿 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝑊)) |
| 12 | 11 | ad2ant2lr 749 | . . . . . . 7 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑥 ∈ (Base‘𝑊)) |
| 13 | ocvin.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑊) | |
| 14 | 3, 2, 1, 4, 13 | ipeq0 21618 | . . . . . . 7 ⊢ ((𝑊 ∈ PreHil ∧ 𝑥 ∈ (Base‘𝑊)) → ((𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊)) ↔ 𝑥 = 0 )) |
| 15 | 9, 12, 14 | syl2anc 585 | . . . . . 6 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → ((𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊)) ↔ 𝑥 = 0 )) |
| 16 | 8, 15 | mpbid 232 | . . . . 5 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑥 = 0 ) |
| 17 | 16 | ex 412 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆)) → 𝑥 = 0 )) |
| 18 | elin 3905 | . . . 4 ⊢ (𝑥 ∈ (𝑆 ∩ ( ⊥ ‘𝑆)) ↔ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) | |
| 19 | velsn 4583 | . . . 4 ⊢ (𝑥 ∈ { 0 } ↔ 𝑥 = 0 ) | |
| 20 | 17, 18, 19 | 3imtr4g 296 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑥 ∈ (𝑆 ∩ ( ⊥ ‘𝑆)) → 𝑥 ∈ { 0 })) |
| 21 | 20 | ssrdv 3927 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ⊆ { 0 }) |
| 22 | phllmod 21610 | . . 3 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
| 23 | 1, 10 | lssss 20931 | . . . . 5 ⊢ (𝑆 ∈ 𝐿 → 𝑆 ⊆ (Base‘𝑊)) |
| 24 | 1, 5, 10 | ocvlss 21652 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ (Base‘𝑊)) → ( ⊥ ‘𝑆) ∈ 𝐿) |
| 25 | 23, 24 | sylan2 594 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → ( ⊥ ‘𝑆) ∈ 𝐿) |
| 26 | 10 | lssincl 20960 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝐿 ∧ ( ⊥ ‘𝑆) ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
| 27 | 22, 26 | syl3an1 1164 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿 ∧ ( ⊥ ‘𝑆) ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
| 28 | 25, 27 | mpd3an3 1465 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
| 29 | 13, 10 | lss0ss 20944 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) → { 0 } ⊆ (𝑆 ∩ ( ⊥ ‘𝑆))) |
| 30 | 22, 28, 29 | syl2an2r 686 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → { 0 } ⊆ (𝑆 ∩ ( ⊥ ‘𝑆))) |
| 31 | 21, 30 | eqssd 3939 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) = { 0 }) |
| Colors of variables: wff setvar class |
| Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1542 ∈ wcel 2114 ∩ cin 3888 ⊆ wss 3889 {csn 4567 ‘cfv 6498 (class class class)co 7367 Basecbs 17179 Scalarcsca 17223 ·𝑖cip 17225 0gc0g 17402 LModclmod 20855 LSubSpclss 20926 PreHilcphl 21604 ocvcocv 21640 |
| This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1797 ax-4 1811 ax-5 1912 ax-6 1969 ax-7 2010 ax-8 2116 ax-9 2124 ax-10 2147 ax-11 2163 ax-12 2185 ax-ext 2708 ax-rep 5212 ax-sep 5231 ax-nul 5241 ax-pow 5307 ax-pr 5375 ax-un 7689 ax-cnex 11094 ax-resscn 11095 ax-1cn 11096 ax-icn 11097 ax-addcl 11098 ax-addrcl 11099 ax-mulcl 11100 ax-mulrcl 11101 ax-mulcom 11102 ax-addass 11103 ax-mulass 11104 ax-distr 11105 ax-i2m1 11106 ax-1ne0 11107 ax-1rid 11108 ax-rnegex 11109 ax-rrecex 11110 ax-cnre 11111 ax-pre-lttri 11112 ax-pre-lttrn 11113 ax-pre-ltadd 11114 ax-pre-mulgt0 11115 |
| This theorem depends on definitions: df-bi 207 df-an 396 df-or 849 df-3or 1088 df-3an 1089 df-tru 1545 df-fal 1555 df-ex 1782 df-nf 1786 df-sb 2069 df-mo 2539 df-eu 2569 df-clab 2715 df-cleq 2728 df-clel 2811 df-nfc 2885 df-ne 2933 df-nel 3037 df-ral 3052 df-rex 3062 df-rmo 3342 df-reu 3343 df-rab 3390 df-v 3431 df-sbc 3729 df-csb 3838 df-dif 3892 df-un 3894 df-in 3896 df-ss 3906 df-pss 3909 df-nul 4274 df-if 4467 df-pw 4543 df-sn 4568 df-pr 4570 df-op 4574 df-uni 4851 df-int 4890 df-iun 4935 df-br 5086 df-opab 5148 df-mpt 5167 df-tr 5193 df-id 5526 df-eprel 5531 df-po 5539 df-so 5540 df-fr 5584 df-we 5586 df-xp 5637 df-rel 5638 df-cnv 5639 df-co 5640 df-dm 5641 df-rn 5642 df-res 5643 df-ima 5644 df-pred 6265 df-ord 6326 df-on 6327 df-lim 6328 df-suc 6329 df-iota 6454 df-fun 6500 df-fn 6501 df-f 6502 df-f1 6503 df-fo 6504 df-f1o 6505 df-fv 6506 df-riota 7324 df-ov 7370 df-oprab 7371 df-mpo 7372 df-om 7818 df-1st 7942 df-2nd 7943 df-frecs 8231 df-wrecs 8262 df-recs 8311 df-rdg 8349 df-er 8643 df-map 8775 df-en 8894 df-dom 8895 df-sdom 8896 df-pnf 11181 df-mnf 11182 df-xr 11183 df-ltxr 11184 df-le 11185 df-sub 11379 df-neg 11380 df-nn 12175 df-2 12244 df-3 12245 df-4 12246 df-5 12247 df-6 12248 df-7 12249 df-8 12250 df-sets 17134 df-slot 17152 df-ndx 17164 df-base 17180 df-plusg 17233 df-sca 17236 df-vsca 17237 df-ip 17238 df-0g 17404 df-mgm 18608 df-sgrp 18687 df-mnd 18703 df-grp 18912 df-minusg 18913 df-sbg 18914 df-ghm 19188 df-cmn 19757 df-abl 19758 df-mgp 20122 df-rng 20134 df-ur 20163 df-ring 20216 df-lmod 20857 df-lss 20927 df-lmhm 21017 df-lvec 21098 df-sra 21168 df-rgmod 21169 df-phl 21606 df-ocv 21643 |
| This theorem is referenced by: ocv1 21659 pjdm2 21691 pjff 21692 pjf2 21694 pjfo 21695 obselocv 21708 |
| Copyright terms: Public domain | W3C validator |