| 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 20503 | . . 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 21434 | . . . 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 4747 | . . . . . 6 ⊢ (𝜑 → {𝑋} ⊆ 𝐵) |
| 17 | eqid 2760 | . . . . . . 7 ⊢ (LIdeal‘𝑅) = (LIdeal‘𝑅) | |
| 18 | 9, 1, 17 | rspcl 21427 | . . . . . 6 ⊢ ((𝑅 ∈ Ring ∧ {𝑋} ⊆ 𝐵) → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 19 | 8, 16, 18 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 20 | 19 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅)) |
| 21 | simpr 490 | . . . . 5 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → 𝑌 ∈ (𝐾‘{𝑋})) | |
| 22 | 21 | snssd 4747 | . . . 4 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → {𝑌} ⊆ (𝐾‘{𝑋})) |
| 23 | 9, 17 | rspssp 21431 | . . . 4 ⊢ ((𝑅 ∈ Ring ∧ (𝐾‘{𝑋}) ∈ (LIdeal‘𝑅) ∧ {𝑌} ⊆ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) |
| 24 | 15, 20, 22, 23 | syl3anc 1398 | . . 3 ⊢ ((𝜑 ∧ 𝑌 ∈ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) |
| 25 | simpr 490 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) → (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) | |
| 26 | dvdsrspss.y | . . . . . 6 ⊢ (𝜑 → 𝑌 ∈ 𝐵) | |
| 27 | 26 | snssd 4747 | . . . . . . 7 ⊢ (𝜑 → {𝑌} ⊆ 𝐵) |
| 28 | 9, 1 | rspssid 21428 | . . . . . . 7 ⊢ ((𝑅 ∈ Ring ∧ {𝑌} ⊆ 𝐵) → {𝑌} ⊆ (𝐾‘{𝑌})) |
| 29 | 8, 27, 28 | syl2anc 596 | . . . . . 6 ⊢ (𝜑 → {𝑌} ⊆ (𝐾‘{𝑌})) |
| 30 | snssg 4744 | . . . . . . 7 ⊢ (𝑌 ∈ 𝐵 → (𝑌 ∈ (𝐾‘{𝑌}) ↔ {𝑌} ⊆ (𝐾‘{𝑌}))) | |
| 31 | 30 | biimpar 483 | . . . . . 6 ⊢ ((𝑌 ∈ 𝐵 ∧ {𝑌} ⊆ (𝐾‘{𝑌})) → 𝑌 ∈ (𝐾‘{𝑌})) |
| 32 | 26, 29, 31 | syl2anc 596 | . . . . 5 ⊢ (𝜑 → 𝑌 ∈ (𝐾‘{𝑌})) |
| 33 | 32 | adantr 486 | . . . 4 ⊢ ((𝜑 ∧ (𝐾‘{𝑌}) ⊆ (𝐾‘{𝑋})) → 𝑌 ∈ (𝐾‘{𝑌})) |
| 34 | 25, 33 | sseldd 3932 | . . 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 1570 ∈ wcel 2145 ∃wrex 3086 ⊆ wss 3899 {csn 4584 class class class wbr 5103 ‘cfv 6533 (class class class)co 7413 Basecbs 17301 .rcmulr 17343 Ringcrg 20372 ∥rcdsr 20495 LIdealclidl 21393 RSpancrsp 21394 |
| This proof depends on axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1828 ax-4 1842 ax-5 1943 ax-6 2000 ax-7 2041 ax-8 2147 ax-9 2155 ax-10 2178 ax-11 2194 ax-12 2213 ax-ext 2732 ax-rep 5232 ax-sep 5251 ax-nul 5263 ax-pow 5330 ax-pr 5398 ax-un 7736 ax-cnex 11180 ax-resscn 11181 ax-1cn 11182 ax-icn 11183 ax-addcl 11184 ax-addrcl 11185 ax-mulcl 11186 ax-mulrcl 11187 ax-mulcom 11188 ax-addass 11189 ax-mulass 11190 ax-distr 11191 ax-i2m1 11192 ax-1ne0 11193 ax-1rid 11194 ax-rnegex 11195 ax-rrecex 11196 ax-cnre 11197 ax-pre-lttri 11198 ax-pre-lttrn 11199 ax-pre-ltadd 11200 ax-pre-mulgt0 11201 |
| This proof depends on definitions: df-bi 210 df-an 402 df-or 862 df-3or 1104 df-3an 1105 df-tru 1573 df-fal 1583 df-ex 1813 df-nf 1817 df-sb 2100 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 3740 df-csb 3848 df-dif 3902 df-un 3904 df-in 3906 df-ss 3916 df-pss 3919 df-nul 4280 df-if 4483 df-pw 4559 df-sn 4585 df-pr 4587 df-op 4591 df-uni 4868 df-int 4908 df-iun 4953 df-br 5104 df-opab 5168 df-mpt 5187 df-tr 5213 df-id 5550 df-eprel 5555 df-po 5563 df-so 5564 df-fr 5608 df-we 5610 df-xp 5661 df-rel 5662 df-cnv 5663 df-co 5664 df-dm 5665 df-rn 5666 df-res 5667 df-ima 5668 df-pred 6299 df-ord 6360 df-on 6361 df-lim 6362 df-suc 6363 df-iota 6489 df-fun 6535 df-fn 6536 df-f 6537 df-f1 6538 df-fo 6539 df-f1o 6540 df-fv 6541 df-riota 7370 df-ov 7416 df-oprab 7417 df-mpo 7418 df-om 7863 df-1st 7986 df-2nd 7987 df-frecs 8280 df-wrecs 8311 df-recs 8360 df-rdg 8399 df-er 8696 df-en 8953 df-dom 8954 df-sdom 8955 df-pnf 11269 df-mnf 11270 df-xr 11271 df-ltxr 11272 df-le 11273 df-sub 11467 df-neg 11468 df-nn 12258 df-2 12327 df-3 12328 df-4 12329 df-5 12330 df-6 12331 df-7 12332 df-8 12333 df-sets 17256 df-slot 17274 df-ndx 17286 df-base 17302 df-ress 17323 df-plusg 17355 df-mulr 17356 df-sca 17358 df-vsca 17359 df-ip 17360 df-0g 17526 df-mgm 18730 df-sgrp 18821 df-mnd 18837 df-grp 19060 df-minusg 19061 df-sbg 19062 df-subg 19246 df-mgp 20274 df-ur 20321 df-ring 20374 df-dvdsr 20498 df-subrg 20732 df-lmod 21046 df-lss 21116 df-lsp 21156 df-sra 21357 df-rgmod 21358 df-lidl 21395 df-rsp 21396 |
| This theorem is used by: rspsnasso 33821 |
| Copyright terms: Public domain | W3C validator |