| Mathbox for Thierry Arnoux |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > Mathboxes > dvdsrspss | Structured version Visualization version GIF version | ||
| Description: In a ring, an element 𝑋 divides 𝑌 iff the ideal generated by 𝑌 is a subset of the ideal generated by 𝑋. (Contributed by Thierry Arnoux, 22-Mar-2025.) |
| Ref | Expression |
|---|---|
| dvdsrspss.b | ⊢ 𝐵 = (Base‘𝑅) |
| dvdsrspss.k | ⊢ 𝐾 = (RSpan‘𝑅) |
| dvdsrspss.d | ⊢ ∥ = (∥r‘𝑅) |
| dvdsrspss.x | ⊢ (𝜑 → 𝑋 ∈ 𝐵) |
| dvdsrspss.y | ⊢ (𝜑 → 𝑌 ∈ 𝐵) |
| dvdsrspss.r | ⊢ (𝜑 → 𝑅 ∈ Ring) |
| Ref | Expression |
|---|---|
| dvdsrspss | ⊢ (𝜑 → (𝑋 ∥ 𝑌 ↔ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋}))) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | dvdsrspss.b | . . . 4 ⊢ 𝐵 = (Base‘𝑅) | |
| 2 | dvdsrspss.d | . . . 4 ⊢ ∥ = (∥r‘𝑅) | |
| 3 | eqid 2760 | . . . 4 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 4 | 1, 2, 3 | dvdsr 20601 | . . 3 ⊢ (𝑋 ∥ 𝑌 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌)) |
| 5 | dvdsrspss.x | . . . 4 ⊢ (𝜑 → 𝑋 ∈ 𝐵) | |
| 6 | 5 | biantrurd 542 | . . 3 ⊢ (𝜑 → (∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌 ↔ (𝑋 ∈ 𝐵 ∧ ∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌))) |
| 7 | 4, 6 | bitr4id 293 | . 2 ⊢ (𝜑 → (𝑋 ∥ 𝑌 ↔ ∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌)) |
| 8 | dvdsrspss.r | . . . 4 ⊢ (𝜑 → 𝑅 ∈ Ring) | |
| 9 | dvdsrspss.k | . . . . 5 ⊢ 𝐾 = (RSpan‘𝑅) | |
| 10 | 1, 3, 9 | elrspsn 21534 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ 𝑋 ∈ 𝐵) → (𝑌 ∈ (𝐾‘{𝑋}) ↔ ∃𝑡 ∈ 𝐵 𝑌 = (𝑡(.r‘𝑅)𝑋))) |
| 11 | 8, 5, 10 | syl2anc 596 | . . 3 ⊢ (𝜑 → (𝑌 ∈ (𝐾‘{𝑋}) ↔ ∃𝑡 ∈ 𝐵 𝑌 = (𝑡(.r‘𝑅)𝑋))) |
| 12 | eqcom 2767 | . . . 4 ⊢ ((𝑡(.r‘𝑅)𝑋) = 𝑌 ↔ 𝑌 = (𝑡(.r‘𝑅)𝑋)) | |
| 13 | 12 | rexbii 3109 | . . 3 ⊢ (∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌 ↔ ∃𝑡 ∈ 𝐵 𝑌 = (𝑡(.r‘𝑅)𝑋)) |
| 14 | 11, 13 | bitr4di 292 | . 2 ⊢ (𝜑 → (𝑌 ∈ (𝐾‘{𝑋}) ↔ ∃𝑡 ∈ 𝐵 (𝑡(.r‘𝑅)𝑋) = 𝑌)) |
| 15 | 8 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → 𝑅 ∈ Ring) |
| 16 | 5 | snssd 4743 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝐵) |
| 17 | eqid 2760 | . . . . . . 7 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅) | |
| 18 | 9, 1, 17 | rspcl 21527 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ {𝑋} ⊆ 𝐵) → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 19 | 8, 16, 18 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 20 | 19 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 21 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → 𝑌 ∈ (𝐾‘{𝑋})) | |
| 22 | 21 | snssd 4743 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → {𝑌} ⊆ (𝐾‘{𝑋})) |
| 23 | 9, 17 | rspssp 21531 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅) ∧ {𝑌} ⊆ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) |
| 24 | 15, 20, 22, 23 | syl3anc 1398 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) |
| 25 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) | |
| 26 | dvdsrspss.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 27 | 26 | snssd 4743 | . . . . . . 7 ⊢ (𝜑 → {𝑌} ⊆ 𝐵) |
| 28 | 9, 1 | rspssid 21528 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ {𝑌} ⊆ 𝐵) → {𝑌} ⊆ (𝐾‘{𝑌})) |
| 29 | 8, 27, 28 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → {𝑌} ⊆ (𝐾‘{𝑌})) |
| 30 | snssg 4740 | . . . . . . 7 ⊢ (𝑌 ∈ 𝐵 → (𝑌 ∈ (𝐾‘{𝑌}) ↔ {𝑌} ⊆ (𝐾‘{𝑌}))) | |
| 31 | 30 | biimpar 483 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐵 ∧ {𝑌} ⊆ (𝐾‘{𝑌})) → 𝑌 ∈ (𝐾‘{𝑌})) |
| 32 | 26, 29, 31 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝐾‘{𝑌})) |
| 33 | 32 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) → 𝑌 ∈ (𝐾‘{𝑌})) |
| 34 | 25, 33 | sseldd 3910 | . . 3 ⊢ ((𝜑 ∧ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) → 𝑌 ∈ (𝐾‘{𝑋})) |
| 35 | 24, 34 | impbida 813 | . 2 ⊢ (𝜑 → (𝑌 ∈ (𝐾‘{𝑋}) ↔ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋}))) |
| 36 | 7, 14, 35 | 3bitr2d 310 | 1 ⊢ (𝜑 → (𝑋 ∥ 𝑌 ↔ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋}))) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 = wceq 1569 ∈ wcel 2144 ∃wrex 3086 ⊆ wss 3896 {csn 4584 class class class wbr 5102 ‘cfv 6543 (class class class)co 7424 Basecbs 17396 .rcmulr 17438 Ringcrg 20468 ∥rcdsr 20593 LIdealclidl 21493 RSpancrsp 21494 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1827 ax-4 1841 ax-5 1942 ax-6 1999 ax-7 2040 ax-8 2146 ax-9 2154 ax-10 2177 ax-11 2193 ax-12 2212 ax-ext 2732 ax-rep 5231 ax-sep 5248 ax-nul 5259 ax-pow 5327 ax-pr 5391 ax-un 7755 ax-cnex 11263 ax-resscn 11264 ax-1cn 11265 ax-icn 11266 ax-addcl 11267 ax-addrcl 11268 ax-mulcl 11269 ax-mulrcl 11270 ax-mulcom 11271 ax-addass 11272 ax-mulass 11273 ax-distr 11274 ax-i2m1 11275 ax-1ne0 11276 ax-1rid 11277 ax-rnegex 11278 ax-rrecex 11279 ax-cnre 11280 ax-pre-lttri 11281 ax-pre-lttrn 11282 ax-pre-ltadd 11283 ax-pre-mulgt0 11284 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1572 df-fal 1582 df-ex 1812 df-nf 1816 df-sb 2099 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 3739 df-csb 3848 df-ss 3897 df-pss 4013 df-dif 4046 df-in 4090 df-un 4150 df-nul 4278 df-if 4482 df-pw 4558 df-sn 4585 df-pr 4587 df-op 4835 df-uni 4867 df-int 4907 df-iun 4952 df-br 5103 df-opab 5167 df-mpt 5186 df-tr 5212 df-id 5546 df-eprel 5551 df-po 5559 df-so 5560 df-fr 5604 df-we 5606 df-xp 5657 df-rel 5658 df-cnv 5659 df-co 5660 df-dm 5661 df-rn 5662 df-res 5663 df-ima 5664 df-pred 6307 df-ord 6368 df-on 6369 df-lim 6370 df-suc 6371 df-iota 6497 df-fun 6545 df-fn 6546 df-f 6547 df-f1 6548 df-fo 6549 df-f1o 6550 df-fv 6551 df-riota 7381 df-ov 7427 df-oprab 7428 df-mpo 7429 df-om 7882 df-1st 8005 df-2nd 8006 df-frecs 8306 df-wrecs 8337 df-recs 8386 df-rdg 8425 df-er 8724 df-en 8981 df-dom 8982 df-sdom 8983 df-pnf 11352 df-mnf 11353 df-xr 11354 df-ltxr 11355 df-le 11356 df-sub 11550 df-neg 11551 df-nn 12343 df-2 12412 df-3 12413 df-4 12414 df-5 12415 df-6 12416 df-7 12417 df-8 12418 df-sets 17351 df-slot 17369 df-ndx 17381 df-base 17397 df-ress 17418 df-plusg 17450 df-mulr 17451 df-sca 17453 df-vsca 17454 df-ip 17455 df-0g 17621 df-mgm 18825 df-sgrp 18917 df-mnd 18933 df-grp 19156 df-minusg 19157 df-sbg 19158 df-subg 19342 df-mgp 20370 df-ur 20417 df-ring 20470 df-dvdsr 20596 df-subrg 20831 df-lmod 21146 df-lss 21216 df-lsp 21256 df-sra 21457 df-rgmod 21458 df-lidl 21495 df-rsp 21496 |
| This theorem is used by: rspsnasso 33993 |
| Copyright terms: Public domain | W3C validator |