Theorem resrhm2b 14234

Description: Restriction of the codomain of a (ring) homomorphism. resghm2b 13820 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 14212	. . . . . 6 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubGrp‘𝑇))
2		resrhm2b.u	. . . . . . 7 ⊢ 𝑈 = (𝑇 ↾s 𝑋)
3	2	resghm2b 13820	. . . . . 6 ⊢ ((𝑋 ∈ (SubGrp‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
4	1, 3	sylan 283	. . . . 5 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → (𝐹 ∈ (𝑆 GrpHom 𝑇) ↔ 𝐹 ∈ (𝑆 GrpHom 𝑈)))
5		eqid 2229	. . . . . . . 8 ⊢ (mulGrp‘𝑇) = (mulGrp‘𝑇)
6	5	subrgsubm 14219	. . . . . . 7 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑋 ∈ (SubMnd‘(mulGrp‘𝑇)))
7		eqid 2229	. . . . . . . 8 ⊢ ((mulGrp‘𝑇) ↾s 𝑋) = ((mulGrp‘𝑇) ↾s 𝑋)
8	7	resmhm2b 13543	. . . . . . 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 14211	. . . . . . . . . 10 ⊢ (𝑋 ∈ (SubRing‘𝑇) → 𝑇 ∈ Ring)
11	2, 5	mgpress 13915	. . . . . . . . . 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 6026	. . . . . . 7 ⊢ ((𝑋 ∈ (SubRing‘𝑇) ∧ ran 𝐹 ⊆ 𝑋) → ((mulGrp‘𝑆) MndHom ((mulGrp‘𝑇) ↾s 𝑋)) = ((mulGrp‘𝑆) MndHom (mulGrp‘𝑈)))
15	14	eleq2d 2299	. . . . . 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 14209	. . . . . 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 2229	. . 3 ⊢ (mulGrp‘𝑆) = (mulGrp‘𝑆)
28	27, 5	isrhm 14143	. 2 ⊢ (𝐹 ∈ (𝑆 RingHom 𝑇) ↔ ((𝑆 ∈ Ring ∧ 𝑇 ∈ Ring) ∧ (𝐹 ∈ (𝑆 GrpHom 𝑇) ∧ 𝐹 ∈ ((mulGrp‘𝑆) MndHom (mulGrp‘𝑇)))))
29		eqid 2229	. . 3 ⊢ (mulGrp‘𝑈) = (mulGrp‘𝑈)
30	27, 29	isrhm 14143	. 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 1395   ∈ wcel 2200   ⊆ wss 3197  ran crn 4721  ‘cfv 5321  (class class class)co 6010   ↾_s cress 13054   MndHom cmhm 13511  SubMndcsubmnd 13512  SubGrpcsubg 13725   GrpHom cghm 13798  mulGrpcmgp 13904  Ringcrg 13980   RingHom crh 14135  SubRingcsubrg 14202

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 617  ax-in2 618  ax-io 714  ax-5 1493  ax-7 1494  ax-gen 1495  ax-ie1 1539  ax-ie2 1540  ax-8 1550  ax-10 1551  ax-11 1552  ax-i12 1553  ax-bndl 1555  ax-4 1556  ax-17 1572  ax-i9 1576  ax-ial 1580  ax-i5r 1581  ax-13 2202  ax-14 2203  ax-ext 2211  ax-coll 4199  ax-sep 4202  ax-pow 4259  ax-pr 4294  ax-un 4525  ax-setind 4630  ax-cnex 8106  ax-resscn 8107  ax-1cn 8108  ax-1re 8109  ax-icn 8110  ax-addcl 8111  ax-addrcl 8112  ax-mulcl 8113  ax-addcom 8115  ax-addass 8117  ax-i2m1 8120  ax-0lt1 8121  ax-0id 8123  ax-rnegex 8124  ax-pre-ltirr 8127  ax-pre-lttrn 8129  ax-pre-ltadd 8131

This theorem depends on definitions:  df-bi 117  df-3an 1004  df-tru 1398  df-fal 1401  df-nf 1507  df-sb 1809  df-eu 2080  df-mo 2081  df-clab 2216  df-cleq 2222  df-clel 2225  df-nfc 2361  df-ne 2401  df-nel 2496  df-ral 2513  df-rex 2514  df-reu 2515  df-rmo 2516  df-rab 2517  df-v 2801  df-sbc 3029  df-csb 3125  df-dif 3199  df-un 3201  df-in 3203  df-ss 3210  df-nul 3492  df-pw 3651  df-sn 3672  df-pr 3673  df-op 3675  df-uni 3889  df-int 3924  df-iun 3967  df-br 4084  df-opab 4146  df-mpt 4147  df-id 4385  df-xp 4726  df-rel 4727  df-cnv 4728  df-co 4729  df-dm 4730  df-rn 4731  df-res 4732  df-ima 4733  df-iota 5281  df-fun 5323  df-fn 5324  df-f 5325  df-f1 5326  df-fo 5327  df-f1o 5328  df-fv 5329  df-riota 5963  df-ov 6013  df-oprab 6014  df-mpo 6015  df-1st 6295  df-2nd 6296  df-map 6810  df-pnf 8199  df-mnf 8200  df-ltxr 8202  df-inn 9127  df-2 9185  df-3 9186  df-ndx 13056  df-slot 13057  df-base 13059  df-sets 13060  df-iress 13061  df-plusg 13144  df-mulr 13145  df-0g 13312  df-mgm 13410  df-sgrp 13456  df-mnd 13471  df-mhm 13513  df-submnd 13514  df-grp 13557  df-minusg 13558  df-subg 13728  df-ghm 13799  df-mgp 13905  df-ur 13944  df-ring 13982  df-rhm 14137  df-subrg 14204

This theorem is referenced by: (None)