![]() |
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 | oveq1 7457 | . . . . . 6 ⊢ (𝑚 = (1r‘𝑆) → (𝑚 · 𝑋) = ((1r‘𝑆) · 𝑋)) | |
2 | 1 | eqeq2d 2751 | . . . . 5 ⊢ (𝑚 = (1r‘𝑆) → (𝑋 = (𝑚 · 𝑋) ↔ 𝑋 = ((1r‘𝑆) · 𝑋))) |
3 | prjspertr.s | . . . . . . 7 ⊢ 𝑆 = (Scalar‘𝑉) | |
4 | prjspertr.k | . . . . . . 7 ⊢ 𝐾 = (Base‘𝑆) | |
5 | eqid 2740 | . . . . . . 7 ⊢ (1r‘𝑆) = (1r‘𝑆) | |
6 | 3, 4, 5 | lmod1cl 20911 | . . . . . 6 ⊢ (𝑉 ∈ LMod → (1r‘𝑆) ∈ 𝐾) |
7 | 6 | adantr 480 | . . . . 5 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → (1r‘𝑆) ∈ 𝐾) |
8 | eldifi 4154 | . . . . . . . 8 ⊢ (𝑋 ∈ ((Base‘𝑉) ∖ {(0g‘𝑉)}) → 𝑋 ∈ (Base‘𝑉)) | |
9 | prjspertr.b | . . . . . . . 8 ⊢ 𝐵 = ((Base‘𝑉) ∖ {(0g‘𝑉)}) | |
10 | 8, 9 | eleq2s 2862 | . . . . . . 7 ⊢ (𝑋 ∈ 𝐵 → 𝑋 ∈ (Base‘𝑉)) |
11 | eqid 2740 | . . . . . . . 8 ⊢ (Base‘𝑉) = (Base‘𝑉) | |
12 | prjspertr.x | . . . . . . . 8 ⊢ · = ( ·𝑠 ‘𝑉) | |
13 | 11, 3, 12, 5 | lmodvs1 20912 | . . . . . . 7 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ (Base‘𝑉)) → ((1r‘𝑆) · 𝑋) = 𝑋) |
14 | 10, 13 | sylan2 592 | . . . . . 6 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ((1r‘𝑆) · 𝑋) = 𝑋) |
15 | 14 | eqcomd 2746 | . . . . 5 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → 𝑋 = ((1r‘𝑆) · 𝑋)) |
16 | 2, 7, 15 | rspcedvdw 3638 | . . . 4 ⊢ ((𝑉 ∈ LMod ∧ 𝑋 ∈ 𝐵) → ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) |
17 | 16 | ex 412 | . . 3 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 → ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
18 | 17 | pm4.71d 561 | . 2 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)))) |
19 | pm4.24 563 | . . . 4 ⊢ (𝑋 ∈ 𝐵 ↔ (𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵)) | |
20 | 19 | anbi1i 623 | . . 3 ⊢ ((𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) ↔ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
21 | prjsprel.1 | . . . 4 ⊢ ∼ = {〈𝑥, 𝑦〉 ∣ ((𝑥 ∈ 𝐵 ∧ 𝑦 ∈ 𝐵) ∧ ∃𝑙 ∈ 𝐾 𝑥 = (𝑙 · 𝑦))} | |
22 | 21 | prjsprel 42561 | . . 3 ⊢ (𝑋 ∼ 𝑋 ↔ ((𝑋 ∈ 𝐵 ∧ 𝑋 ∈ 𝐵) ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋))) |
23 | 20, 22 | bitr4i 278 | . 2 ⊢ ((𝑋 ∈ 𝐵 ∧ ∃𝑚 ∈ 𝐾 𝑋 = (𝑚 · 𝑋)) ↔ 𝑋 ∼ 𝑋) |
24 | 18, 23 | bitrdi 287 | 1 ⊢ (𝑉 ∈ LMod → (𝑋 ∈ 𝐵 ↔ 𝑋 ∼ 𝑋)) |
Colors of variables: wff setvar class |
Syntax hints: → wi 4 ↔ wb 206 ∧ wa 395 = wceq 1537 ∈ wcel 2108 ∃wrex 3076 ∖ cdif 3973 {csn 4648 class class class wbr 5166 {copab 5228 ‘cfv 6575 (class class class)co 7450 Basecbs 17260 Scalarcsca 17316 ·𝑠 cvsca 17317 0gc0g 17501 1rcur 20210 LModclmod 20882 |
This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1793 ax-4 1807 ax-5 1909 ax-6 1967 ax-7 2007 ax-8 2110 ax-9 2118 ax-10 2141 ax-11 2158 ax-12 2178 ax-ext 2711 ax-sep 5317 ax-nul 5324 ax-pow 5383 ax-pr 5447 ax-un 7772 ax-cnex 11242 ax-resscn 11243 ax-1cn 11244 ax-icn 11245 ax-addcl 11246 ax-addrcl 11247 ax-mulcl 11248 ax-mulrcl 11249 ax-mulcom 11250 ax-addass 11251 ax-mulass 11252 ax-distr 11253 ax-i2m1 11254 ax-1ne0 11255 ax-1rid 11256 ax-rnegex 11257 ax-rrecex 11258 ax-cnre 11259 ax-pre-lttri 11260 ax-pre-lttrn 11261 ax-pre-ltadd 11262 ax-pre-mulgt0 11263 |
This theorem depends on definitions: df-bi 207 df-an 396 df-or 847 df-3or 1088 df-3an 1089 df-tru 1540 df-fal 1550 df-ex 1778 df-nf 1782 df-sb 2065 df-mo 2543 df-eu 2572 df-clab 2718 df-cleq 2732 df-clel 2819 df-nfc 2895 df-ne 2947 df-nel 3053 df-ral 3068 df-rex 3077 df-rmo 3388 df-reu 3389 df-rab 3444 df-v 3490 df-sbc 3805 df-csb 3922 df-dif 3979 df-un 3981 df-in 3983 df-ss 3993 df-pss 3996 df-nul 4353 df-if 4549 df-pw 4624 df-sn 4649 df-pr 4651 df-op 4655 df-uni 4932 df-iun 5017 df-br 5167 df-opab 5229 df-mpt 5250 df-tr 5284 df-id 5593 df-eprel 5599 df-po 5607 df-so 5608 df-fr 5652 df-we 5654 df-xp 5706 df-rel 5707 df-cnv 5708 df-co 5709 df-dm 5710 df-rn 5711 df-res 5712 df-ima 5713 df-pred 6334 df-ord 6400 df-on 6401 df-lim 6402 df-suc 6403 df-iota 6527 df-fun 6577 df-fn 6578 df-f 6579 df-f1 6580 df-fo 6581 df-f1o 6582 df-fv 6583 df-riota 7406 df-ov 7453 df-oprab 7454 df-mpo 7455 df-om 7906 df-2nd 8033 df-frecs 8324 df-wrecs 8355 df-recs 8429 df-rdg 8468 df-er 8765 df-en 9006 df-dom 9007 df-sdom 9008 df-pnf 11328 df-mnf 11329 df-xr 11330 df-ltxr 11331 df-le 11332 df-sub 11524 df-neg 11525 df-nn 12296 df-2 12358 df-sets 17213 df-slot 17231 df-ndx 17243 df-base 17261 df-plusg 17326 df-0g 17503 df-mgm 18680 df-sgrp 18759 df-mnd 18775 df-mgp 20164 df-ur 20211 df-ring 20264 df-lmod 20884 |
This theorem is referenced by: prjsper 42565 |
Copyright terms: Public domain | W3C validator |