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 2610 | . . . . . . . . 9 ⊢ (Base‘𝑊) = (Base‘𝑊) | |
2 | eqid 2610 | . . . . . . . . 9 ⊢ (·𝑖‘𝑊) = (·𝑖‘𝑊) | |
3 | eqid 2610 | . . . . . . . . 9 ⊢ (Scalar‘𝑊) = (Scalar‘𝑊) | |
4 | eqid 2610 | . . . . . . . . 9 ⊢ (0g‘(Scalar‘𝑊)) = (0g‘(Scalar‘𝑊)) | |
5 | ocv2ss.o | . . . . . . . . 9 ⊢ ⊥ = (ocv‘𝑊) | |
6 | 1, 2, 3, 4, 5 | ocvi 19832 | . . . . . . . 8 ⊢ ((𝑥 ∈ ( ⊥ ‘𝑆) ∧ 𝑥 ∈ 𝑆) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
7 | 6 | ancoms 468 | . . . . . . 7 ⊢ ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆)) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
8 | 7 | adantl 481 | . . . . . 6 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → (𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊))) |
9 | simpll 786 | . . . . . . 7 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑊 ∈ PreHil) | |
10 | ocvin.l | . . . . . . . . 9 ⊢ 𝐿 = (LSubSp‘𝑊) | |
11 | 1, 10 | lssel 18759 | . . . . . . . 8 ⊢ ((𝑆 ∈ 𝐿 ∧ 𝑥 ∈ 𝑆) → 𝑥 ∈ (Base‘𝑊)) |
12 | 11 | ad2ant2lr 780 | . . . . . . 7 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑥 ∈ (Base‘𝑊)) |
13 | ocvin.z | . . . . . . . 8 ⊢ 0 = (0g‘𝑊) | |
14 | 3, 2, 1, 4, 13 | ipeq0 19802 | . . . . . . 7 ⊢ ((𝑊 ∈ PreHil ∧ 𝑥 ∈ (Base‘𝑊)) → ((𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊)) ↔ 𝑥 = 0 )) |
15 | 9, 12, 14 | syl2anc 691 | . . . . . 6 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → ((𝑥(·𝑖‘𝑊)𝑥) = (0g‘(Scalar‘𝑊)) ↔ 𝑥 = 0 )) |
16 | 8, 15 | mpbid 221 | . . . . 5 ⊢ (((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) ∧ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) → 𝑥 = 0 ) |
17 | 16 | ex 449 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → ((𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆)) → 𝑥 = 0 )) |
18 | elin 3758 | . . . 4 ⊢ (𝑥 ∈ (𝑆 ∩ ( ⊥ ‘𝑆)) ↔ (𝑥 ∈ 𝑆 ∧ 𝑥 ∈ ( ⊥ ‘𝑆))) | |
19 | velsn 4141 | . . . 4 ⊢ (𝑥 ∈ { 0 } ↔ 𝑥 = 0 ) | |
20 | 17, 18, 19 | 3imtr4g 284 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑥 ∈ (𝑆 ∩ ( ⊥ ‘𝑆)) → 𝑥 ∈ { 0 })) |
21 | 20 | ssrdv 3574 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ⊆ { 0 }) |
22 | phllmod 19794 | . . . 4 ⊢ (𝑊 ∈ PreHil → 𝑊 ∈ LMod) | |
23 | 22 | adantr 480 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → 𝑊 ∈ LMod) |
24 | 1, 10 | lssss 18758 | . . . . 5 ⊢ (𝑆 ∈ 𝐿 → 𝑆 ⊆ (Base‘𝑊)) |
25 | 1, 5, 10 | ocvlss 19835 | . . . . 5 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ⊆ (Base‘𝑊)) → ( ⊥ ‘𝑆) ∈ 𝐿) |
26 | 24, 25 | sylan2 490 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → ( ⊥ ‘𝑆) ∈ 𝐿) |
27 | 10 | lssincl 18786 | . . . . 5 ⊢ ((𝑊 ∈ LMod ∧ 𝑆 ∈ 𝐿 ∧ ( ⊥ ‘𝑆) ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
28 | 22, 27 | syl3an1 1351 | . . . 4 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿 ∧ ( ⊥ ‘𝑆) ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
29 | 26, 28 | mpd3an3 1417 | . . 3 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) |
30 | 13, 10 | lss0ss 18770 | . . 3 ⊢ ((𝑊 ∈ LMod ∧ (𝑆 ∩ ( ⊥ ‘𝑆)) ∈ 𝐿) → { 0 } ⊆ (𝑆 ∩ ( ⊥ ‘𝑆))) |
31 | 23, 29, 30 | syl2anc 691 | . 2 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → { 0 } ⊆ (𝑆 ∩ ( ⊥ ‘𝑆))) |
32 | 21, 31 | eqssd 3585 | 1 ⊢ ((𝑊 ∈ PreHil ∧ 𝑆 ∈ 𝐿) → (𝑆 ∩ ( ⊥ ‘𝑆)) = { 0 }) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 195 ∧ wa 383 = wceq 1475 ∈ wcel 1977 ∩ cin 3539 ⊆ wss 3540 {csn 4125 ‘cfv 5804 (class class class)co 6549 Basecbs 15695 Scalarcsca 15771 ·𝑖cip 15773 0gc0g 15923 LModclmod 18686 LSubSpclss 18753 PreHilcphl 19788 ocvcocv 19823 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1713 ax-4 1728 ax-5 1827 ax-6 1875 ax-7 1922 ax-8 1979 ax-9 1986 ax-10 2006 ax-11 2021 ax-12 2034 ax-13 2234 ax-ext 2590 ax-rep 4699 ax-sep 4709 ax-nul 4717 ax-pow 4769 ax-pr 4833 ax-un 6847 ax-cnex 9871 ax-resscn 9872 ax-1cn 9873 ax-icn 9874 ax-addcl 9875 ax-addrcl 9876 ax-mulcl 9877 ax-mulrcl 9878 ax-mulcom 9879 ax-addass 9880 ax-mulass 9881 ax-distr 9882 ax-i2m1 9883 ax-1ne0 9884 ax-1rid 9885 ax-rnegex 9886 ax-rrecex 9887 ax-cnre 9888 ax-pre-lttri 9889 ax-pre-lttrn 9890 ax-pre-ltadd 9891 ax-pre-mulgt0 9892 |
This theorem depends on definitions: df-bi 196 df-or 384 df-an 385 df-3or 1032 df-3an 1033 df-tru 1478 df-ex 1696 df-nf 1701 df-sb 1868 df-eu 2462 df-mo 2463 df-clab 2597 df-cleq 2603 df-clel 2606 df-nfc 2740 df-ne 2782 df-nel 2783 df-ral 2901 df-rex 2902 df-reu 2903 df-rmo 2904 df-rab 2905 df-v 3175 df-sbc 3403 df-csb 3500 df-dif 3543 df-un 3545 df-in 3547 df-ss 3554 df-pss 3556 df-nul 3875 df-if 4037 df-pw 4110 df-sn 4126 df-pr 4128 df-tp 4130 df-op 4132 df-uni 4373 df-int 4411 df-iun 4457 df-br 4584 df-opab 4644 df-mpt 4645 df-tr 4681 df-eprel 4949 df-id 4953 df-po 4959 df-so 4960 df-fr 4997 df-we 4999 df-xp 5044 df-rel 5045 df-cnv 5046 df-co 5047 df-dm 5048 df-rn 5049 df-res 5050 df-ima 5051 df-pred 5597 df-ord 5643 df-on 5644 df-lim 5645 df-suc 5646 df-iota 5768 df-fun 5806 df-fn 5807 df-f 5808 df-f1 5809 df-fo 5810 df-f1o 5811 df-fv 5812 df-riota 6511 df-ov 6552 df-oprab 6553 df-mpt2 6554 df-om 6958 df-1st 7059 df-2nd 7060 df-wrecs 7294 df-recs 7355 df-rdg 7393 df-er 7629 df-en 7842 df-dom 7843 df-sdom 7844 df-pnf 9955 df-mnf 9956 df-xr 9957 df-ltxr 9958 df-le 9959 df-sub 10147 df-neg 10148 df-nn 10898 df-2 10956 df-3 10957 df-4 10958 df-5 10959 df-6 10960 df-7 10961 df-8 10962 df-ndx 15698 df-slot 15699 df-base 15700 df-sets 15701 df-plusg 15781 df-sca 15784 df-vsca 15785 df-ip 15786 df-0g 15925 df-mgm 17065 df-sgrp 17107 df-mnd 17118 df-grp 17248 df-minusg 17249 df-sbg 17250 df-ghm 17481 df-mgp 18313 df-ur 18325 df-ring 18372 df-lmod 18688 df-lss 18754 df-lmhm 18843 df-lvec 18924 df-sra 18993 df-rgmod 18994 df-phl 19790 df-ocv 19826 |
This theorem is referenced by: ocv1 19842 pjdm2 19874 pjff 19875 pjf2 19877 pjfo 19878 obselocv 19891 |
Copyright terms: Public domain | W3C validator |