| Metamath Proof Explorer |
< Previous
Next >
Nearby theorems |
||
| Mirrors > Home > MPE Home > Th. List > subrngint | Structured version Visualization version GIF version | ||
| Description: The intersection of a nonempty collection of subrings is a subring. (Contributed by AV, 15-Feb-2025.) |
| Ref | Expression |
|---|---|
| subrngint | ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → ∩ 𝑆 ∈ (SubRng‘𝑅)) |
| Step | Hyp | Ref | Expression |
|---|---|---|---|
| 1 | subrngsubg 20855 | . . . . 5 ⊢ (𝑟 ∈ (SubRng‘𝑅) → 𝑟 ∈ (SubGrp‘𝑅)) | |
| 2 | 1 | ssriv 3917 | . . . 4 ⊢ (SubRng‘𝑅) ⊆ (SubGrp‘𝑅) |
| 3 | sstr 3921 | . . . 4 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ (SubRng‘𝑅) ⊆ (SubGrp‘𝑅)) → 𝑆 ⊆ (SubGrp‘𝑅)) | |
| 4 | 2, 3 | mpan2 704 | . . 3 ⊢ (𝑆 ⊆ (SubRng‘𝑅) → 𝑆 ⊆ (SubGrp‘𝑅)) |
| 5 | subgint 19411 | . . 3 ⊢ ((𝑆 ⊆ (SubGrp‘𝑅) ∧ 𝑆 ≠ ∅) → ∩ 𝑆 ∈ (SubGrp‘𝑅)) | |
| 6 | 4, 5 | sylan 592 | . 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → ∩ 𝑆 ∈ (SubGrp‘𝑅)) |
| 7 | ssel2 3908 | . . . . . . 7 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑟 ∈ 𝑆) → 𝑟 ∈ (SubRng‘𝑅)) | |
| 8 | 7 | ad4ant14 765 | . . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑟 ∈ (SubRng‘𝑅)) |
| 9 | simprl 783 | . . . . . . 7 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑥 ∈ ∩ 𝑆) | |
| 10 | elinti 4921 | . . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑆 → (𝑟 ∈ 𝑆 → 𝑥 ∈ 𝑟)) | |
| 11 | 10 | imp 412 | . . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑆 ∧ 𝑟 ∈ 𝑆) → 𝑥 ∈ 𝑟) |
| 12 | 9, 11 | sylan 592 | . . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑥 ∈ 𝑟) |
| 13 | simprr 785 | . . . . . . 7 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑦 ∈ ∩ 𝑆) | |
| 14 | elinti 4921 | . . . . . . . 8 ⊢ (𝑦 ∈ ∩ 𝑆 → (𝑟 ∈ 𝑆 → 𝑦 ∈ 𝑟)) | |
| 15 | 14 | imp 412 | . . . . . . 7 ⊢ ((𝑦 ∈ ∩ 𝑆 ∧ 𝑟 ∈ 𝑆) → 𝑦 ∈ 𝑟) |
| 16 | 13, 15 | sylan 592 | . . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑦 ∈ 𝑟) |
| 17 | eqid 2763 | . . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅) | |
| 18 | 17 | subrngmcl 20860 | . . . . . 6 ⊢ ((𝑟 ∈ (SubRng‘𝑅) ∧ 𝑥 ∈ 𝑟 ∧ 𝑦 ∈ 𝑟) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑟) |
| 19 | 8, 12, 16, 18 | syl3anc 1399 | . . . . 5 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑟) |
| 20 | 19 | ralrimiva 3158 | . . . 4 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟) |
| 21 | ovex 7484 | . . . . 5 ⊢ (𝑥(.r‘𝑅)𝑦) ∈ V | |
| 22 | 21 | elint2 4919 | . . . 4 ⊢ ((𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟) |
| 23 | 20, 22 | sylibr 237 | . . 3 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → (𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆) |
| 24 | 23 | ralrimivva 3209 | . 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆) |
| 25 | ssn0 4358 | . . 3 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → (SubRng‘𝑅) ≠ ∅) | |
| 26 | n0 4303 | . . . 4 ⊢ ((SubRng‘𝑅) ≠ ∅ ↔ ∃𝑟 𝑟 ∈ (SubRng‘𝑅)) | |
| 27 | subrngrcl 20854 | . . . . 5 ⊢ (𝑟 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng) | |
| 28 | 27 | exlimiv 1965 | . . . 4 ⊢ (∃𝑟 𝑟 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng) |
| 29 | 26, 28 | sylbi 220 | . . 3 ⊢ ((SubRng‘𝑅) ≠ ∅ → 𝑅 ∈ Rng) |
| 30 | eqid 2763 | . . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅) | |
| 31 | 30, 17 | issubrng2 20861 | . . 3 ⊢ (𝑅 ∈ Rng → (∩ 𝑆 ∈ (SubRng‘𝑅) ↔ (∩ 𝑆 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆))) |
| 32 | 25, 29, 31 | 3syl 19 | . 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → (∩ 𝑆 ∈ (SubRng‘𝑅) ↔ (∩ 𝑆 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆))) |
| 33 | 6, 24, 32 | mpbir2and 726 | 1 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑆 ≠ ∅) → ∩ 𝑆 ∈ (SubRng‘𝑅)) |
| Colors of variables: wff setvar class |
| This proof depends on syntax axioms: → wi 4 ↔ wb 209 ∧ wa 401 ∃wex 1812 ∈ wcel 2147 ≠ wne 2959 ∀wral 3080 ⊆ wss 3900 ∅c0 4281 ∩ cint 4912 ‘cfv 6566 (class class class)co 7451 Basecbs 17431 .rcmulr 17473 SubGrpcsubg 19380 Rngcrng 20425 SubRngcsubrng 20848 |
| 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 1945 ax-6 2002 ax-7 2043 ax-8 2149 ax-9 2157 ax-10 2180 ax-11 2197 ax-12 2216 ax-ext 2735 ax-sep 5255 ax-nul 5266 ax-pow 5334 ax-pr 5398 ax-un 7783 ax-cnex 11295 ax-resscn 11296 ax-1cn 11297 ax-icn 11298 ax-addcl 11299 ax-addrcl 11300 ax-mulcl 11301 ax-mulrcl 11302 ax-mulcom 11303 ax-addass 11304 ax-mulass 11305 ax-distr 11306 ax-i2m1 11307 ax-1ne0 11308 ax-1rid 11309 ax-rnegex 11310 ax-rrecex 11311 ax-cnre 11312 ax-pre-lttri 11313 ax-pre-lttrn 11314 ax-pre-ltadd 11315 ax-pre-mulgt0 11316 |
| 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 2102 df-mo 2567 df-eu 2597 df-clab 2742 df-cleq 2755 df-clel 2839 df-nfc 2913 df-ne 2960 df-nel 3066 df-ral 3081 df-rex 3091 df-rmo 3369 df-reu 3370 df-rab 3417 df-v 3456 df-sbc 3743 df-csb 3852 df-ss 3901 df-pss 4017 df-dif 4050 df-in 4094 df-un 4154 df-nul 4282 df-if 4486 df-pw 4562 df-sn 4589 df-pr 4591 df-op 4841 df-uni 4873 df-int 4913 df-iun 4958 df-br 5109 df-opab 5174 df-mpt 5193 df-tr 5219 df-id 5553 df-eprel 5558 df-po 5566 df-so 5567 df-fr 5611 df-we 5613 df-xp 5664 df-rel 5665 df-cnv 5666 df-co 5667 df-dm 5668 df-rn 5669 df-res 5670 df-ima 5671 df-pred 6330 df-ord 6391 df-on 6392 df-lim 6393 df-suc 6394 df-iota 6520 df-fun 6568 df-fn 6569 df-f 6570 df-f1 6571 df-fo 6572 df-f1o 6573 df-fv 6574 df-riota 7408 df-ov 7454 df-oprab 7455 df-mpo 7456 df-om 7912 df-2nd 8036 df-frecs 8337 df-wrecs 8368 df-recs 8417 df-rdg 8456 df-er 8755 df-en 9012 df-dom 9013 df-sdom 9014 df-pnf 11384 df-mnf 11385 df-xr 11386 df-ltxr 11387 df-le 11388 df-sub 11582 df-neg 11583 df-nn 12376 df-2 12445 df-3 12446 df-sets 17386 df-slot 17404 df-ndx 17416 df-base 17432 df-ress 17453 df-plusg 17486 df-mulr 17487 df-0g 17662 df-mgm 18866 df-sgrp 18958 df-mnd 18974 df-grp 19197 df-minusg 19198 df-subg 19383 df-cmn 20047 df-abl 20048 df-mgp 20412 df-rng 20426 df-subrng 20849 |
| This theorem is used by: subrngin 20864 subrngmre 20865 |
| Copyright terms: Public domain | W3C validator |