Theorem resrhm2b 13881

Description: Restriction of the codomain of a (ring) homomorphism. resghm2b 13468 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 13859	. . . . . 6 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubGrp‘𝑇))
2		resrhm2b.u	. . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
3	2	resghm2b 13468	. . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
4	1, 3	sylan 283	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
5		eqid 2196	. . . . . . . 8 ⊢ (mulGrp‘𝑇) = (mulGrp‘𝑇)
6	5	subrgsubm 13866	. . . . . . 7 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubMnd‘(mulGrp‘𝑇)))
7		eqid 2196	. . . . . . . 8 ⊢ ((mulGrp‘𝑇) ↾s 𝑋) = ((mulGrp‘𝑇) ↾s 𝑋)
8	7	resmhm2b 13191	. . . . . . 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 13858	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑇 ∈ Ring)
11	2, 5	mgpress 13563	. . . . . . . . . 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 5941	. . . . . . 7 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋)) = ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))
15	14	eleq2d 2266	. . . . . 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 13856	. . . . . 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 2196	. . 3 ⊢ (mulGrp‘𝑆) = (mulGrp‘𝑆)
28	27, 5	isrhm 13790	. 2 ⊢ (𝐹 ∈ (𝑆 RingHom 𝑇) ↔ ((𝑆 ∈ Ring ∧ 𝑇 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))))
29		eqid 2196	. . 3 ⊢ (mulGrp‘𝑈) = (mulGrp‘𝑈)
30	27, 29	isrhm 13790	. 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 2167   ⊆ wss 3157  ran crn 4665  ‘cfv 5259  (class class class)co 5925   ↾_s cress 12704   MndHom cmhm 13159  SubMndcsubmnd 13160  SubGrpcsubg 13373   GrpHom cghm 13446  mulGrpcmgp 13552  Ringcrg 13628   RingHom crh 13782  SubRingcsubrg 13849

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 1461  ax-7 1462  ax-gen 1463  ax-ie1 1507  ax-ie2 1508  ax-8 1518  ax-10 1519  ax-11 1520  ax-i12 1521  ax-bndl 1523  ax-4 1524  ax-17 1540  ax-i9 1544  ax-ial 1548  ax-i5r 1549  ax-13 2169  ax-14 2170  ax-ext 2178  ax-coll 4149  ax-sep 4152  ax-pow 4208  ax-pr 4243  ax-un 4469  ax-setind 4574  ax-cnex 7987  ax-resscn 7988  ax-1cn 7989  ax-1re 7990  ax-icn 7991  ax-addcl 7992  ax-addrcl 7993  ax-mulcl 7994  ax-addcom 7996  ax-addass 7998  ax-i2m1 8001  ax-0lt1 8002  ax-0id 8004  ax-rnegex 8005  ax-pre-ltirr 8008  ax-pre-lttrn 8010  ax-pre-ltadd 8012

This theorem depends on definitions:  df-bi 117  df-3an 982  df-tru 1367  df-fal 1370  df-nf 1475  df-sb 1777  df-eu 2048  df-mo 2049  df-clab 2183  df-cleq 2189  df-clel 2192  df-nfc 2328  df-ne 2368  df-nel 2463  df-ral 2480  df-rex 2481  df-reu 2482  df-rmo 2483  df-rab 2484  df-v 2765  df-sbc 2990  df-csb 3085  df-dif 3159  df-un 3161  df-in 3163  df-ss 3170  df-nul 3452  df-pw 3608  df-sn 3629  df-pr 3630  df-op 3632  df-uni 3841  df-int 3876  df-iun 3919  df-br 4035  df-opab 4096  df-mpt 4097  df-id 4329  df-xp 4670  df-rel 4671  df-cnv 4672  df-co 4673  df-dm 4674  df-rn 4675  df-res 4676  df-ima 4677  df-iota 5220  df-fun 5261  df-fn 5262  df-f 5263  df-f1 5264  df-fo 5265  df-f1o 5266  df-fv 5267  df-riota 5880  df-ov 5928  df-oprab 5929  df-mpo 5930  df-1st 6207  df-2nd 6208  df-map 6718  df-pnf 8080  df-mnf 8081  df-ltxr 8083  df-inn 9008  df-2 9066  df-3 9067  df-ndx 12706  df-slot 12707  df-base 12709  df-sets 12710  df-iress 12711  df-plusg 12793  df-mulr 12794  df-0g 12960  df-mgm 13058  df-sgrp 13104  df-mnd 13119  df-mhm 13161  df-submnd 13162  df-grp 13205  df-minusg 13206  df-subg 13376  df-ghm 13447  df-mgp 13553  df-ur 13592  df-ring 13630  df-rhm 13784  df-subrg 13851

This theorem is referenced by: (None)