Theorem subrngintm 14604

Description: The intersection of a nonempty collection of subrings is a subring. (Contributed by AV, 15-Feb-2025.)

Assertion

Ref	Expression
subrngintm	⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ∩ 𝑆 ∈ (SubRng‘𝑅))

Distinct variable groups:   𝑅,𝑗   𝑆,𝑗

Proof of Theorem subrngintm

Dummy variables 𝑟 𝑥 𝑦 are mutually distinct and distinct from all other variables.

Step	Hyp	Ref	Expression
1		subrngsubg 14596	. . . . 5 ⊢ (𝑟 ∈ (SubRng‘𝑅) → 𝑟 ∈ (SubGrp‘𝑅))
2	1	ssriv 3252	. . . 4 ⊢ (SubRng‘𝑅) ⊆ (SubGrp‘𝑅)
3		sstr 3256	. . . 4 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ (SubRng‘𝑅) ⊆ (SubGrp‘𝑅)) → 𝑆 ⊆ (SubGrp‘𝑅))
4	2, 3	mpan2 429	. . 3 ⊢ (𝑆 ⊆ (SubRng‘𝑅) → 𝑆 ⊆ (SubGrp‘𝑅))
5		subgintm 14054	. . 3 ⊢ ((𝑆 ⊆ (SubGrp‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ∩ 𝑆 ∈ (SubGrp‘𝑅))
6	4, 5	sylan 283	. 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ∩ 𝑆 ∈ (SubGrp‘𝑅))
7		ssel2 3243	. . . . . . 7 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ 𝑟 ∈ 𝑆) → 𝑟 ∈ (SubRng‘𝑅))
8	7	ad4ant14 518	. . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑟 ∈ (SubRng‘𝑅))
9		simprl 535	. . . . . . 7 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑥 ∈ ∩ 𝑆)
10		elinti 3979	. . . . . . . 8 ⊢ (𝑥 ∈ ∩ 𝑆 → (𝑟 ∈ 𝑆 → 𝑥 ∈ 𝑟))
11	10	imp 124	. . . . . . 7 ⊢ ((𝑥 ∈ ∩ 𝑆 ∧ 𝑟 ∈ 𝑆) → 𝑥 ∈ 𝑟)
12	9, 11	sylan 283	. . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑥 ∈ 𝑟)
13		simprr 537	. . . . . . 7 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → 𝑦 ∈ ∩ 𝑆)
14		elinti 3979	. . . . . . . 8 ⊢ (𝑦 ∈ ∩ 𝑆 → (𝑟 ∈ 𝑆 → 𝑦 ∈ 𝑟))
15	14	imp 124	. . . . . . 7 ⊢ ((𝑦 ∈ ∩ 𝑆 ∧ 𝑟 ∈ 𝑆) → 𝑦 ∈ 𝑟)
16	13, 15	sylan 283	. . . . . 6 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → 𝑦 ∈ 𝑟)
17		eqid 2238	. . . . . . 7 ⊢ (.r‘𝑅) = (.r‘𝑅)
18	17	subrngmcl 14601	. . . . . 6 ⊢ ((𝑟 ∈ (SubRng‘𝑅) ∧ 𝑥 ∈ 𝑟 ∧ 𝑦 ∈ 𝑟) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑟)
19	8, 12, 16, 18	syl3anc 1278	. . . . 5 ⊢ ((((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) ∧ 𝑟 ∈ 𝑆) → (𝑥(.r‘𝑅)𝑦) ∈ 𝑟)
20	19	ralrimiva 2623	. . . 4 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟)
21		ssel 3242	. . . . . . . . 9 ⊢ (𝑆 ⊆ (SubRng‘𝑅) → (𝑗 ∈ 𝑆 → 𝑗 ∈ (SubRng‘𝑅)))
22		subrngrcl 14595	. . . . . . . . 9 ⊢ (𝑗 ∈ (SubRng‘𝑅) → 𝑅 ∈ Rng)
23	21, 22	syl6 33	. . . . . . . 8 ⊢ (𝑆 ⊆ (SubRng‘𝑅) → (𝑗 ∈ 𝑆 → 𝑅 ∈ Rng))
24	23	exlimdv 1872	. . . . . . 7 ⊢ (𝑆 ⊆ (SubRng‘𝑅) → (∃𝑗 𝑗 ∈ 𝑆 → 𝑅 ∈ Rng))
25	24	imp 124	. . . . . 6 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → 𝑅 ∈ Rng)
26		vex 2824	. . . . . . . 8 ⊢ 𝑥 ∈ V
27	26	a1i 9	. . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑥 ∈ V)
28		mulrslid 13539	. . . . . . . 8 ⊢ (.r = Slot (.r‘ndx) ∧ (.r‘ndx) ∈ ℕ)
29	28	slotex 13431	. . . . . . 7 ⊢ (𝑅 ∈ Rng → (.r‘𝑅) ∈ V)
30		vex 2824	. . . . . . . 8 ⊢ 𝑦 ∈ V
31	30	a1i 9	. . . . . . 7 ⊢ (𝑅 ∈ Rng → 𝑦 ∈ V)
32		ovexg 6119	. . . . . . 7 ⊢ ((𝑥 ∈ V ∧ (.r‘𝑅) ∈ V ∧ 𝑦 ∈ V) → (𝑥(.r‘𝑅)𝑦) ∈ V)
33	27, 29, 31, 32	syl3anc 1278	. . . . . 6 ⊢ (𝑅 ∈ Rng → (𝑥(.r‘𝑅)𝑦) ∈ V)
34		elintg 3978	. . . . . 6 ⊢ ((𝑥(.r‘𝑅)𝑦) ∈ V → ((𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟))
35	25, 33, 34	3syl 17	. . . . 5 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ((𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟))
36	35	adantr 276	. . . 4 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → ((𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆 ↔ ∀𝑟 ∈ 𝑆 (𝑥(.r‘𝑅)𝑦) ∈ 𝑟))
37	20, 36	mpbird 167	. . 3 ⊢ (((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) ∧ (𝑥 ∈ ∩ 𝑆 ∧ 𝑦 ∈ ∩ 𝑆)) → (𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆)
38	37	ralrimivva 2632	. 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆)
39		eqid 2238	. . . 4 ⊢ (Base‘𝑅) = (Base‘𝑅)
40	39, 17	issubrng2 14602	. . 3 ⊢ (𝑅 ∈ Rng → (∩ 𝑆 ∈ (SubRng‘𝑅) ↔ (∩ 𝑆 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆)))
41	25, 40	syl 14	. 2 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → (∩ 𝑆 ∈ (SubRng‘𝑅) ↔ (∩ 𝑆 ∈ (SubGrp‘𝑅) ∧ ∀𝑥 ∈ ∩ 𝑆∀𝑦 ∈ ∩ 𝑆(𝑥(.r‘𝑅)𝑦) ∈ ∩ 𝑆)))
42	6, 38, 41	mpbir2and 957	1 ⊢ ((𝑆 ⊆ (SubRng‘𝑅) ∧ ∃𝑗 𝑗 ∈ 𝑆) → ∩ 𝑆 ∈ (SubRng‘𝑅))

This proof depends on syntax axioms:   → wi 4   ∧ wa 104   ↔ wb 105  ∃wex 1545   ∈ wcel 2209  ∀wral 2528  Vcvv 2821   ⊆ wss 3220  ∩ cint 3970  ‘cfv 5377  (class class class)co 6085  Basecbs 13404  ._rcmulr 13485  SubGrpcsubg 14023  Rngcrng 14315  SubRngcsubrng 14589

This proof depends on axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 623  ax-in2 624  ax-io 721  ax-5 1500  ax-7 1501  ax-gen 1502  ax-ie1 1546  ax-ie2 1547  ax-8 1557  ax-10 1558  ax-11 1559  ax-i12 1560  ax-bndl 1562  ax-4 1563  ax-17 1579  ax-i9 1583  ax-ial 1587  ax-i5r 1588  ax-14 2212  ax-ext 2220  ax-coll 4246  ax-sep 4249  ax-pow 4311  ax-pr 4346  ax-un 4578  ax-setind 4684  ax-cnex 8271  ax-resscn 8272  ax-1cn 8273  ax-1re 8274  ax-icn 8275  ax-addcl 8276  ax-addrcl 8277  ax-mulcl 8278  ax-addcom 8280  ax-addass 8282  ax-i2m1 8285  ax-0lt1 8286  ax-0id 8288  ax-rnegex 8289  ax-pre-ltirr 8292  ax-pre-lttrn 8294  ax-pre-ltadd 8296

This proof depends on definitions:  df-bi 117  df-3an 1011  df-tru 1405  df-fal 1408  df-nf 1514  df-sb 1816  df-eu 2089  df-mo 2090  df-clab 2225  df-cleq 2231  df-clel 2234  df-nfc 2381  df-ne 2421  df-nel 2516  df-ral 2533  df-rex 2534  df-reu 2535  df-rmo 2536  df-rab 2537  df-v 2823  df-sbc 3052  df-csb 3148  df-dif 3222  df-un 3224  df-in 3226  df-ss 3233  df-nul 3521  df-pw 3690  df-sn 3715  df-pr 3716  df-op 3718  df-uni 3936  df-int 3971  df-iun 4014  df-br 4131  df-opab 4193  df-mpt 4194  df-id 4438  df-xp 4780  df-rel 4781  df-cnv 4782  df-co 4783  df-dm 4784  df-rn 4785  df-res 4786  df-ima 4787  df-iota 5337  df-fun 5379  df-fn 5380  df-f 5381  df-f1 5382  df-fo 5383  df-f1o 5384  df-fv 5385  df-riota 6038  df-ov 6088  df-oprab 6089  df-mpo 6090  df-pnf 8363  df-mnf 8364  df-ltxr 8366  df-inn 9308  df-2 9366  df-3 9367  df-ndx 13407  df-slot 13408  df-base 13410  df-sets 13411  df-iress 13412  df-plusg 13497  df-mulr 13498  df-0g 13665  df-mgm 13729  df-sgrp 13770  df-mnd 13783  df-grp 13861  df-minusg 13862  df-subg 14026  df-cmn 14173  df-abl 14174  df-mgp 14302  df-rng 14316  df-subrng 14590

This theorem is used by:  subrngin  14605