Mathbox for Steven Nguyen |
< Previous
Next >
Nearby theorems |
||
Mirrors > Home > MPE Home > Th. List > Mathboxes > prjsperref | Structured version Visualization version GIF version |
Description: The relation in ℙ𝕣𝕠𝕛 is reflexive. (Contributed by Steven Nguyen, 30-Apr-2023.) |
Ref | Expression |
---|---|
prjsprel.1 | ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))} |
prjspertr.b | ⊢ 𝐵 = ((Base‘𝑉) ∖ {(0g‘𝑉)}) |
prjspertr.s | ⊢ 𝑆 = (Scalar‘𝑉) |
prjspertr.x | ⊢ · = ( ·𝑠 ‘𝑉) |
prjspertr.k | ⊢ 𝐾 = (Base‘𝑆) |
Ref | Expression |
---|---|
prjsperref | ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 ↔ 𝑋 ∼ 𝑋)) |
Step | Hyp | Ref | Expression |
---|---|---|---|
1 | prjspertr.s | . . . . . . 7 ⊢ 𝑆 = (Scalar‘𝑉) | |
2 | prjspertr.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝑆) | |
3 | eqid 2820 | . . . . . . 7 ⊢ (1r‘𝑆) = (1r‘𝑆) | |
4 | 1, 2, 3 | lmod1cl 19656 | . . . . . 6 ⊢ (𝑉 ∈ LMod → (1r‘𝑆) ∈ 𝐾) |
5 | 4 | adantr 483 | . . . . 5 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (1r‘𝑆) ∈ 𝐾) |
6 | oveq1 7156 | . . . . . . 7 ⊢ (𝑚 = (1r‘𝑆) → (𝑚 · 𝑋) = ((1r‘𝑆) · 𝑋)) | |
7 | 6 | eqeq2d 2831 | . . . . . 6 ⊢ (𝑚 = (1r‘𝑆) → (𝑋 = (𝑚 · 𝑋) ↔ 𝑋 = ((1r‘𝑆) · 𝑋))) |
8 | 7 | adantl 484 | . . . . 5 ⊢ (((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) ∧ 𝑚 = (1r‘𝑆)) → (𝑋 = (𝑚 · 𝑋) ↔ 𝑋 = ((1r‘𝑆) · 𝑋))) |
9 | eldifi 4096 | . . . . . . . 8 ⊢ (𝑋 ∈ ((Base‘𝑉) ∖ {(0g‘𝑉)}) → 𝑋 ∈ (Base‘𝑉)) | |
10 | prjspertr.b | . . . . . . . 8 ⊢ 𝐵 = ((Base‘𝑉) ∖ {(0g‘𝑉)}) | |
11 | 9, 10 | eleq2s 2930 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ (Base‘𝑉)) |
12 | eqid 2820 | . . . . . . . 8 ⊢ (Base‘𝑉) = (Base‘𝑉) | |
13 | prjspertr.x | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑉) | |
14 | 12, 1, 13, 3 | lmodvs1 19657 | . . . . . . 7 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ (Base‘𝑉)) → ((1r‘𝑆) · 𝑋) = 𝑋) |
15 | 11, 14 | sylan2 594 | . . . . . 6 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ((1r‘𝑆) · 𝑋) = 𝑋) |
16 | 15 | eqcomd 2826 | . . . . 5 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → 𝑋 = ((1r‘𝑆) · 𝑋)) |
17 | 5, 8, 16 | rspcedvd 3623 | . . . 4 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) |
18 | 17 | ex 415 | . . 3 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 → ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
19 | 18 | pm4.71d 564 | . 2 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)))) |
20 | pm4.24 566 | . . . 4 ⊢ (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) | |
21 | 20 | anbi1i 625 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
22 | prjsprel.1 | . . . 4 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))} | |
23 | 22 | prjsprel 39330 | . . 3 ⊢ (𝑋 ∼ 𝑋 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
24 | 21, 23 | bitr4i 280 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) ↔ 𝑋 ∼ 𝑋) |
25 | 19, 24 | syl6bb 289 | 1 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 ↔ 𝑋 ∼ 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 208 ∧ wa 398 = wceq 1536 ∈ wcel 2113 ∃wrex 3138 ∖ cdif 3926 {csn 4560 class class class wbr 5059 {copab 5121 ‘cfv 6348 (class class class)co 7149 Basecbs 16478 Scalarcsca 16563 ·𝑠 cvsca 16564 0gc0g 16708 1rcur 19246 LModclmod 19629 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1795 ax-4 1809 ax-5 1910 ax-6 1969 ax-7 2014 ax-8 2115 ax-9 2123 ax-10 2144 ax-11 2160 ax-12 2176 ax-ext 2792 ax-sep 5196 ax-nul 5203 ax-pow 5259 ax-pr 5323 ax-un 7454 ax-cnex 10586 ax-resscn 10587 ax-1cn 10588 ax-icn 10589 ax-addcl 10590 ax-addrcl 10591 ax-mulcl 10592 ax-mulrcl 10593 ax-mulcom 10594 ax-addass 10595 ax-mulass 10596 ax-distr 10597 ax-i2m1 10598 ax-1ne0 10599 ax-1rid 10600 ax-rnegex 10601 ax-rrecex 10602 ax-cnre 10603 ax-pre-lttri 10604 ax-pre-lttrn 10605 ax-pre-ltadd 10606 ax-pre-mulgt0 10607 |
This theorem depends on definitions: df-bi 209 df-an 399 df-or 844 df-3or 1083 df-3an 1084 df-tru 1539 df-ex 1780 df-nf 1784 df-sb 2069 df-mo 2621 df-eu 2653 df-clab 2799 df-cleq 2813 df-clel 2892 df-nfc 2962 df-ne 3016 df-nel 3123 df-ral 3142 df-rex 3143 df-reu 3144 df-rmo 3145 df-rab 3146 df-v 3493 df-sbc 3769 df-csb 3877 df-dif 3932 df-un 3934 df-in 3936 df-ss 3945 df-pss 3947 df-nul 4285 df-if 4461 df-pw 4534 df-sn 4561 df-pr 4563 df-tp 4565 df-op 4567 df-uni 4832 df-iun 4914 df-br 5060 df-opab 5122 df-mpt 5140 df-tr 5166 df-id 5453 df-eprel 5458 df-po 5467 df-so 5468 df-fr 5507 df-we 5509 df-xp 5554 df-rel 5555 df-cnv 5556 df-co 5557 df-dm 5558 df-rn 5559 df-res 5560 df-ima 5561 df-pred 6141 df-ord 6187 df-on 6188 df-lim 6189 df-suc 6190 df-iota 6307 df-fun 6350 df-fn 6351 df-f 6352 df-f1 6353 df-fo 6354 df-f1o 6355 df-fv 6356 df-riota 7107 df-ov 7152 df-oprab 7153 df-mpo 7154 df-om 7574 df-wrecs 7940 df-recs 8001 df-rdg 8039 df-er 8282 df-en 8503 df-dom 8504 df-sdom 8505 df-pnf 10670 df-mnf 10671 df-xr 10672 df-ltxr 10673 df-le 10674 df-sub 10865 df-neg 10866 df-nn 11632 df-2 11694 df-ndx 16481 df-slot 16482 df-base 16484 df-sets 16485 df-plusg 16573 df-0g 16710 df-mgm 17847 df-sgrp 17896 df-mnd 17907 df-mgp 19235 df-ur 19247 df-ring 19294 df-lmod 19631 |
This theorem is referenced by: prjsper 39334 |
Copyright terms: Public domain | W3C validator |