rhmsubcsetclem1 - Metamath Proof Explorer

	Metamath Proof Explorer		< Previous Next > Nearby theorems
Mirrors > Home > MPE Home > Th. List > rhmsubcsetclem1		Structured version Visualization version GIF version

Theorem rhmsubcsetclem1 20582

Description: Lemma 1 for rhmsubcsetc 20584. (Contributed by AV, 9-Mar-2020.)

**Hypotheses**
Ref	Expression
rhmsubcsetc.c	⊢ 𝐶 = (ExtStrCat‘𝑈)
rhmsubcsetc.u	⊢ (𝜑 → 𝑈 ∈ 𝑉)
rhmsubcsetc.b	⊢ (𝜑 → 𝐵 = (Ring ∩ 𝑈))
rhmsubcsetc.h	⊢ (𝜑 → 𝐻 = ( RingHom ↾ (𝐵 × 𝐵)))

**Assertion**
Ref	Expression
rhmsubcsetclem1	⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐻𝑥))

**Proof of Theorem rhmsubcsetclem1**
Step	Hyp	Ref	Expression
1		rhmsubcsetc.b	. . . . . 6 ⊢ (𝜑 → 𝐵 = (Ring ∩ 𝑈))
2	1	eleq2d 2814	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Ring ∩ 𝑈)))
3		elin 3960	. . . . . 6 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) ↔ (𝑥 ∈ Ring ∧ 𝑥 ∈ 𝑈))
4	3	simplbi 497	. . . . 5 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) → 𝑥 ∈ Ring)
5	2, 4	biimtrdi 252	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → 𝑥 ∈ Ring))
6	5	imp 406	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ Ring)
7		eqid 2727	. . . 4 ⊢ (Base‘𝑥) = (Base‘𝑥)
8	7	idrhm 20418	. . 3 ⊢ (𝑥 ∈ Ring → ( I ↾ (Base‘𝑥)) ∈ (𝑥 RingHom 𝑥))
9	6, 8	syl 17	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( I ↾ (Base‘𝑥)) ∈ (𝑥 RingHom 𝑥))
10		rhmsubcsetc.c	. . 3 ⊢ 𝐶 = (ExtStrCat‘𝑈)
11		eqid 2727	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
12		rhmsubcsetc.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
13	12	adantr 480	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑈 ∈ 𝑉)
14	3	simprbi 496	. . . . 5 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) → 𝑥 ∈ 𝑈)
15	2, 14	biimtrdi 252	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝑈))
16	15	imp 406	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝑈)
17	10, 11, 13, 16	estrcid 18115	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((Id‘𝐶)‘𝑥) = ( I ↾ (Base‘𝑥)))
18		rhmsubcsetc.h	. . . 4 ⊢ (𝜑 → 𝐻 = ( RingHom ↾ (𝐵 × 𝐵)))
19	18	oveqdr 7442	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝐻𝑥) = (𝑥( RingHom ↾ (𝐵 × 𝐵))𝑥))
20		eqid 2727	. . . . . . . 8 ⊢ (RingCat‘𝑈) = (RingCat‘𝑈)
21		eqid 2727	. . . . . . . 8 ⊢ (Base‘(RingCat‘𝑈)) = (Base‘(RingCat‘𝑈))
22		eqid 2727	. . . . . . . 8 ⊢ (Hom ‘(RingCat‘𝑈)) = (Hom ‘(RingCat‘𝑈))
23	20, 21, 12, 22	ringchomfval 20573	. . . . . . 7 ⊢ (𝜑 → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈)))))
24	20, 21, 12	ringcbas 20572	. . . . . . . . . 10 ⊢ (𝜑 → (Base‘(RingCat‘𝑈)) = (𝑈 ∩ Ring))
25		incom 4197	. . . . . . . . . . . 12 ⊢ (Ring ∩ 𝑈) = (𝑈 ∩ Ring)
26	1, 25	eqtrdi 2783	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Ring))
27	26	eqcomd 2733	. . . . . . . . . 10 ⊢ (𝜑 → (𝑈 ∩ Ring) = 𝐵)
28	24, 27	eqtrd 2767	. . . . . . . . 9 ⊢ (𝜑 → (Base‘(RingCat‘𝑈)) = 𝐵)
29	28	sqxpeqd 5704	. . . . . . . 8 ⊢ (𝜑 → ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈))) = (𝐵 × 𝐵))
30	29	reseq2d 5979	. . . . . . 7 ⊢ (𝜑 → ( RingHom ↾ ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈)))) = ( RingHom ↾ (𝐵 × 𝐵)))
31	23, 30	eqtrd 2767	. . . . . 6 ⊢ (𝜑 → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ (𝐵 × 𝐵)))
32	31	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ (𝐵 × 𝐵)))
33	32	eqcomd 2733	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( RingHom ↾ (𝐵 × 𝐵)) = (Hom ‘(RingCat‘𝑈)))
34	33	oveqd 7431	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥( RingHom ↾ (𝐵 × 𝐵))𝑥) = (𝑥(Hom ‘(RingCat‘𝑈))𝑥))
35	26	eleq2d 2814	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (𝑈 ∩ Ring)))
36	35	biimpa 476	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝑈 ∩ Ring))
37	24	adantr 480	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (Base‘(RingCat‘𝑈)) = (𝑈 ∩ Ring))
38	36, 37	eleqtrrd 2831	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (Base‘(RingCat‘𝑈)))
39	20, 21, 13, 22, 38, 38	ringchom 20574	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥(Hom ‘(RingCat‘𝑈))𝑥) = (𝑥 RingHom 𝑥))
40	19, 34, 39	3eqtrd 2771	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝐻𝑥) = (𝑥 RingHom 𝑥))
41	9, 17, 40	3eltr4d 2843	1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐻𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 395 = wceq 1534 ∈ wcel 2099 ∩ cin 3943 I cid 5569 × cxp 5670 ↾ cres 5674 ‘cfv 6542 (class class class)co 7414 Basecbs 17171 Hom chom 17235 Idccid 17636 ExtStrCatcestrc 18103 Ringcrg 20164 RingHom crh 20397 RingCatcringc 20567

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1790 ax-4 1804 ax-5 1906 ax-6 1964 ax-7 2004 ax-8 2101 ax-9 2109 ax-10 2130 ax-11 2147 ax-12 2164 ax-ext 2698 ax-rep 5279 ax-sep 5293 ax-nul 5300 ax-pow 5359 ax-pr 5423 ax-un 7734 ax-cnex 11186 ax-resscn 11187 ax-1cn 11188 ax-icn 11189 ax-addcl 11190 ax-addrcl 11191 ax-mulcl 11192 ax-mulrcl 11193 ax-mulcom 11194 ax-addass 11195 ax-mulass 11196 ax-distr 11197 ax-i2m1 11198 ax-1ne0 11199 ax-1rid 11200 ax-rnegex 11201 ax-rrecex 11202 ax-cnre 11203 ax-pre-lttri 11204 ax-pre-lttrn 11205 ax-pre-ltadd 11206 ax-pre-mulgt0 11207

This theorem depends on definitions: df-bi 206 df-an 396 df-or 847 df-3or 1086 df-3an 1087 df-tru 1537 df-fal 1547 df-ex 1775 df-nf 1779 df-sb 2061 df-mo 2529 df-eu 2558 df-clab 2705 df-cleq 2719 df-clel 2805 df-nfc 2880 df-ne 2936 df-nel 3042 df-ral 3057 df-rex 3066 df-rmo 3371 df-reu 3372 df-rab 3428 df-v 3471 df-sbc 3775 df-csb 3890 df-dif 3947 df-un 3949 df-in 3951 df-ss 3961 df-pss 3963 df-nul 4319 df-if 4525 df-pw 4600 df-sn 4625 df-pr 4627 df-tp 4629 df-op 4631 df-uni 4904 df-iun 4993 df-br 5143 df-opab 5205 df-mpt 5226 df-tr 5260 df-id 5570 df-eprel 5576 df-po 5584 df-so 5585 df-fr 5627 df-we 5629 df-xp 5678 df-rel 5679 df-cnv 5680 df-co 5681 df-dm 5682 df-rn 5683 df-res 5684 df-ima 5685 df-pred 6299 df-ord 6366 df-on 6367 df-lim 6368 df-suc 6369 df-iota 6494 df-fun 6544 df-fn 6545 df-f 6546 df-f1 6547 df-fo 6548 df-f1o 6549 df-fv 6550 df-riota 7370 df-ov 7417 df-oprab 7418 df-mpo 7419 df-om 7865 df-1st 7987 df-2nd 7988 df-frecs 8280 df-wrecs 8311 df-recs 8385 df-rdg 8424 df-1o 8480 df-er 8718 df-map 8838 df-en 8956 df-dom 8957 df-sdom 8958 df-fin 8959 df-pnf 11272 df-mnf 11273 df-xr 11274 df-ltxr 11275 df-le 11276 df-sub 11468 df-neg 11469 df-nn 12235 df-2 12297 df-3 12298 df-4 12299 df-5 12300 df-6 12301 df-7 12302 df-8 12303 df-9 12304 df-n0 12495 df-z 12581 df-dec 12700 df-uz 12845 df-fz 13509 df-struct 17107 df-sets 17124 df-slot 17142 df-ndx 17154 df-base 17172 df-ress 17201 df-plusg 17237 df-hom 17248 df-cco 17249 df-0g 17414 df-cat 17639 df-cid 17640 df-resc 17785 df-estrc 18104 df-mgm 18591 df-sgrp 18670 df-mnd 18686 df-mhm 18731 df-grp 18884 df-ghm 19159 df-mgp 20066 df-ur 20113 df-ring 20166 df-rhm 20400 df-ringc 20568

This theorem is referenced by: rhmsubcsetc 20584

W3C validator