Theorem resrhm2b 13748

Description: Restriction of the codomain of a (ring) homomorphism. resghm2b 13335 analog. (Contributed by SN, 7-Feb-2025.)

Hypothesis

Ref	Expression
resrhm2b.u	⊢ 𝑈 = (𝑇 ↾s 𝑋)

Assertion

Ref	Expression
resrhm2b	⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 RingHom 𝑇) ↔ 𝐹 ∈ (𝑆 RingHom 𝑈)))

Proof of Theorem resrhm2b

Step	Hyp	Ref	Expression
1		subrgsubg 13726	. . . . . 6 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubGrp‘𝑇))
2		resrhm2b.u	. . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
3	2	resghm2b 13335	. . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
4	1, 3	sylan 283	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
5		eqid 2193	. . . . . . . 8 ⊢ (mulGrp‘𝑇) = (mulGrp‘𝑇)
6	5	subrgsubm 13733	. . . . . . 7 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubMnd‘(mulGrp‘𝑇)))
7		eqid 2193	. . . . . . . 8 ⊢ ((mulGrp‘𝑇) ↾s 𝑋) = ((mulGrp‘𝑇) ↾s 𝑋)
8	7	resmhm2b 13064	. . . . . . 7 ⊢ ((𝑋 ∈ (SubMnd‘(mulGrp‘𝑇)) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)) ↔ 𝐹 ∈ ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋))))
9	6, 8	sylan 283	. . . . . 6 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)) ↔ 𝐹 ∈ ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋))))
10		subrgrcl 13725	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑇 ∈ Ring)
11	2, 5	mgpress 13430	. . . . . . . . . 10 ⊢ ((𝑇 ∈ Ring ∧ 𝑋 ∈ (SubRing‘𝑇)) → ((mulGrp‘𝑇) ↾s 𝑋) = (mulGrp‘𝑈))
12	10, 11	mpancom 422	. . . . . . . . 9 ⊢ (𝑋 ∈ (SubRing‘𝑇) → ((mulGrp‘𝑇) ↾s 𝑋) = (mulGrp‘𝑈))
13	12	adantr 276	. . . . . . . 8 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((mulGrp‘𝑇) ↾s 𝑋) = (mulGrp‘𝑈))
14	13	oveq2d 5935	. . . . . . 7 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋)) = ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))
15	14	eleq2d 2263	. . . . . 6 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋)) ↔ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈))))
16	9, 15	bitrd 188	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)) ↔ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈))))
17	4, 16	anbi12d 473	. . . 4 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇))) ↔ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))))
18	17	anbi2d 464	. . 3 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((𝑆 ∈ Ring ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))) ↔ (𝑆 ∈ Ring ∧ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈))))))
19	10	adantr 276	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑇 ∈ Ring)
20	19	biantrud 304	. . . 4 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝑆 ∈ Ring ↔ (𝑆 ∈ Ring ∧ 𝑇 ∈ Ring)))
21	20	anbi1d 465	. . 3 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((𝑆 ∈ Ring ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))) ↔ ((𝑆 ∈ Ring ∧ 𝑇 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇))))))
22	2	subrgring 13723	. . . . . 6 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑈 ∈ Ring)
23	22	adantr 276	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → 𝑈 ∈ Ring)
24	23	biantrud 304	. . . 4 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝑆 ∈ Ring ↔ (𝑆 ∈ Ring ∧ 𝑈 ∈ Ring)))
25	24	anbi1d 465	. . 3 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((𝑆 ∈ Ring ∧ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))) ↔ ((𝑆 ∈ Ring ∧ 𝑈 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈))))))
26	18, 21, 25	3bitr3d 218	. 2 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (((𝑆 ∈ Ring ∧ 𝑇 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))) ↔ ((𝑆 ∈ Ring ∧ 𝑈 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈))))))
27		eqid 2193	. . 3 ⊢ (mulGrp‘𝑆) = (mulGrp‘𝑆)
28	27, 5	isrhm 13657	. 2 ⊢ (𝐹 ∈ (𝑆 RingHom 𝑇) ↔ ((𝑆 ∈ Ring ∧ 𝑇 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))))
29		eqid 2193	. . 3 ⊢ (mulGrp‘𝑈) = (mulGrp‘𝑈)
30	27, 29	isrhm 13657	. 2 ⊢ (𝐹 ∈ (𝑆 RingHom 𝑈) ↔ ((𝑆 ∈ Ring ∧ 𝑈 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑈) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))))
31	26, 28, 30	3bitr4g 223	1 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 RingHom 𝑇) ↔ 𝐹 ∈ (𝑆 RingHom 𝑈)))

Syntax hints:   → wi 4   ∧ wa 104   ↔ wb 105   = wceq 1364   ∈ wcel 2164   ⊆ wss 3154  ran crn 4661  ‘cfv 5255  (class class class)co 5919   ↾_s cress 12622   MndHom cmhm 13032  SubMndcsubmnd 13033  SubGrpcsubg 13240   GrpHom cghm 13313  mulGrpcmgp 13419  Ringcrg 13495   RingHom crh 13649  SubRingcsubrg 13716

This theorem was proved from axioms:  ax-mp 5  ax-1 6  ax-2 7  ax-ia1 106  ax-ia2 107  ax-ia3 108  ax-in1 615  ax-in2 616  ax-io 710  ax-5 1458  ax-7 1459  ax-gen 1460  ax-ie1 1504  ax-ie2 1505  ax-8 1515  ax-10 1516  ax-11 1517  ax-i12 1518  ax-bndl 1520  ax-4 1521  ax-17 1537  ax-i9 1541  ax-ial 1545  ax-i5r 1546  ax-13 2166  ax-14 2167  ax-ext 2175  ax-coll 4145  ax-sep 4148  ax-pow 4204  ax-pr 4239  ax-un 4465  ax-setind 4570  ax-cnex 7965  ax-resscn 7966  ax-1cn 7967  ax-1re 7968  ax-icn 7969  ax-addcl 7970  ax-addrcl 7971  ax-mulcl 7972  ax-addcom 7974  ax-addass 7976  ax-i2m1 7979  ax-0lt1 7980  ax-0id 7982  ax-rnegex 7983  ax-pre-ltirr 7986  ax-pre-lttrn 7988  ax-pre-ltadd 7990

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1472  df-sb 1774  df-eu 2045  df-mo 2046  df-clab 2180  df-cleq 2186  df-clel 2189  df-nfc 2325  df-ne 2365  df-nel 2460  df-ral 2477  df-rex 2478  df-reu 2479  df-rmo 2480  df-rab 2481  df-v 2762  df-sbc 2987  df-csb 3082  df-dif 3156  df-un 3158  df-in 3160  df-ss 3167  df-nul 3448  df-pw 3604  df-sn 3625  df-pr 3626  df-op 3628  df-uni 3837  df-int 3872  df-iun 3915  df-br 4031  df-opab 4092  df-mpt 4093  df-id 4325  df-xp 4666  df-rel 4667  df-cnv 4668  df-co 4669  df-dm 4670  df-rn 4671  df-res 4672  df-ima 4673  df-iota 5216  df-fun 5257  df-fn 5258  df-f 5259  df-f1 5260  df-fo 5261  df-f1o 5262  df-fv 5263  df-riota 5874  df-ov 5922  df-oprab 5923  df-mpo 5924  df-1st 6195  df-2nd 6196  df-map 6706  df-pnf 8058  df-mnf 8059  df-ltxr 8061  df-inn 8985  df-2 9043  df-3 9044  df-ndx 12624  df-slot 12625  df-base 12627  df-sets 12628  df-iress 12629  df-plusg 12711  df-mulr 12712  df-0g 12872  df-mgm 12942  df-sgrp 12988  df-mnd 13001  df-mhm 13034  df-submnd 13035  df-grp 13078  df-minusg 13079  df-subg 13243  df-ghm 13314  df-mgp 13420  df-ur 13459  df-ring 13497  df-rhm 13651  df-subrg 13718

This theorem is referenced by: (None)