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 20597

Description: Lemma 1 for rhmsubcsetc 20599. (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 2811	. . . . 5 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (Ring ∩ 𝑈)))
3		elin 3961	. . . . . 6 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) ↔ (𝑥 ∈ Ring ∧ 𝑥 ∈ 𝑈))
4	3	simplbi 496	. . . . 5 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) → 𝑥 ∈ Ring)
5	2, 4	biimtrdi 252	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → 𝑥 ∈ Ring))
6	5	imp 405	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ Ring)
7		eqid 2725	. . . 4 ⊢ (Base‘𝑥) = (Base‘𝑥)
8	7	idrhm 20433	. . 3 ⊢ (𝑥 ∈ Ring → ( I ↾ (Base‘𝑥)) ∈ (𝑥 RingHom 𝑥))
9	6, 8	syl 17	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( I ↾ (Base‘𝑥)) ∈ (𝑥 RingHom 𝑥))
10		rhmsubcsetc.c	. . 3 ⊢ 𝐶 = (ExtStrCat‘𝑈)
11		eqid 2725	. . 3 ⊢ (Id‘𝐶) = (Id‘𝐶)
12		rhmsubcsetc.u	. . . 4 ⊢ (𝜑 → 𝑈 ∈ 𝑉)
13	12	adantr 479	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑈 ∈ 𝑉)
14	3	simprbi 495	. . . . 5 ⊢ (𝑥 ∈ (Ring ∩ 𝑈) → 𝑥 ∈ 𝑈)
15	2, 14	biimtrdi 252	. . . 4 ⊢ (𝜑 → (𝑥 ∈ 𝐵 → 𝑥 ∈ 𝑈))
16	15	imp 405	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ 𝑈)
17	10, 11, 13, 16	estrcid 18123	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((Id‘𝐶)‘𝑥) = ( I ↾ (Base‘𝑥)))
18		rhmsubcsetc.h	. . . 4 ⊢ (𝜑 → 𝐻 = ( RingHom ↾ (𝐵 × 𝐵)))
19	18	oveqdr 7445	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝐻𝑥) = (𝑥( RingHom ↾ (𝐵 × 𝐵))𝑥))
20		eqid 2725	. . . . . . . 8 ⊢ (RingCat‘𝑈) = (RingCat‘𝑈)
21		eqid 2725	. . . . . . . 8 ⊢ (Base‘(RingCat‘𝑈)) = (Base‘(RingCat‘𝑈))
22		eqid 2725	. . . . . . . 8 ⊢ (Hom ‘(RingCat‘𝑈)) = (Hom ‘(RingCat‘𝑈))
23	20, 21, 12, 22	ringchomfval 20588	. . . . . . 7 ⊢ (𝜑 → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈)))))
24	20, 21, 12	ringcbas 20587	. . . . . . . . . 10 ⊢ (𝜑 → (Base‘(RingCat‘𝑈)) = (𝑈 ∩ Ring))
25		incom 4200	. . . . . . . . . . . 12 ⊢ (Ring ∩ 𝑈) = (𝑈 ∩ Ring)
26	1, 25	eqtrdi 2781	. . . . . . . . . . 11 ⊢ (𝜑 → 𝐵 = (𝑈 ∩ Ring))
27	26	eqcomd 2731	. . . . . . . . . 10 ⊢ (𝜑 → (𝑈 ∩ Ring) = 𝐵)
28	24, 27	eqtrd 2765	. . . . . . . . 9 ⊢ (𝜑 → (Base‘(RingCat‘𝑈)) = 𝐵)
29	28	sqxpeqd 5709	. . . . . . . 8 ⊢ (𝜑 → ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈))) = (𝐵 × 𝐵))
30	29	reseq2d 5984	. . . . . . 7 ⊢ (𝜑 → ( RingHom ↾ ((Base‘(RingCat‘𝑈)) × (Base‘(RingCat‘𝑈)))) = ( RingHom ↾ (𝐵 × 𝐵)))
31	23, 30	eqtrd 2765	. . . . . 6 ⊢ (𝜑 → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ (𝐵 × 𝐵)))
32	31	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (Hom ‘(RingCat‘𝑈)) = ( RingHom ↾ (𝐵 × 𝐵)))
33	32	eqcomd 2731	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ( RingHom ↾ (𝐵 × 𝐵)) = (Hom ‘(RingCat‘𝑈)))
34	33	oveqd 7434	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥( RingHom ↾ (𝐵 × 𝐵))𝑥) = (𝑥(Hom ‘(RingCat‘𝑈))𝑥))
35	26	eleq2d 2811	. . . . . 6 ⊢ (𝜑 → (𝑥 ∈ 𝐵 ↔ 𝑥 ∈ (𝑈 ∩ Ring)))
36	35	biimpa 475	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (𝑈 ∩ Ring))
37	24	adantr 479	. . . . 5 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (Base‘(RingCat‘𝑈)) = (𝑈 ∩ Ring))
38	36, 37	eleqtrrd 2828	. . . 4 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → 𝑥 ∈ (Base‘(RingCat‘𝑈)))
39	20, 21, 13, 22, 38, 38	ringchom 20589	. . 3 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥(Hom ‘(RingCat‘𝑈))𝑥) = (𝑥 RingHom 𝑥))
40	19, 34, 39	3eqtrd 2769	. 2 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → (𝑥𝐻𝑥) = (𝑥 RingHom 𝑥))
41	9, 17, 40	3eltr4d 2840	1 ⊢ ((𝜑 ∧ 𝑥 ∈ 𝐵) → ((Id‘𝐶)‘𝑥) ∈ (𝑥𝐻𝑥))

Colors of variables: wff setvar class

Syntax hints: → wi 4 ∧ wa 394 = wceq 1533 ∈ wcel 2098 ∩ cin 3944 I cid 5574 × cxp 5675 ↾ cres 5679 ‘cfv 6547 (class class class)co 7417 Basecbs 17179 Hom chom 17243 Idccid 17644 ExtStrCatcestrc 18111 Ringcrg 20177 RingHom crh 20412 RingCatcringc 20582

This theorem was proved from axioms: ax-mp 5 ax-1 6 ax-2 7 ax-3 8 ax-gen 1789 ax-4 1803 ax-5 1905 ax-6 1963 ax-7 2003 ax-8 2100 ax-9 2108 ax-10 2129 ax-11 2146 ax-12 2166 ax-ext 2696 ax-rep 5285 ax-sep 5299 ax-nul 5306 ax-pow 5364 ax-pr 5428 ax-un 7739 ax-cnex 11194 ax-resscn 11195 ax-1cn 11196 ax-icn 11197 ax-addcl 11198 ax-addrcl 11199 ax-mulcl 11200 ax-mulrcl 11201 ax-mulcom 11202 ax-addass 11203 ax-mulass 11204 ax-distr 11205 ax-i2m1 11206 ax-1ne0 11207 ax-1rid 11208 ax-rnegex 11209 ax-rrecex 11210 ax-cnre 11211 ax-pre-lttri 11212 ax-pre-lttrn 11213 ax-pre-ltadd 11214 ax-pre-mulgt0 11215

This theorem depends on definitions: df-bi 206 df-an 395 df-or 846 df-3or 1085 df-3an 1086 df-tru 1536 df-fal 1546 df-ex 1774 df-nf 1778 df-sb 2060 df-mo 2528 df-eu 2557 df-clab 2703 df-cleq 2717 df-clel 2802 df-nfc 2877 df-ne 2931 df-nel 3037 df-ral 3052 df-rex 3061 df-rmo 3364 df-reu 3365 df-rab 3420 df-v 3465 df-sbc 3775 df-csb 3891 df-dif 3948 df-un 3950 df-in 3952 df-ss 3962 df-pss 3965 df-nul 4324 df-if 4530 df-pw 4605 df-sn 4630 df-pr 4632 df-tp 4634 df-op 4636 df-uni 4909 df-iun 4998 df-br 5149 df-opab 5211 df-mpt 5232 df-tr 5266 df-id 5575 df-eprel 5581 df-po 5589 df-so 5590 df-fr 5632 df-we 5634 df-xp 5683 df-rel 5684 df-cnv 5685 df-co 5686 df-dm 5687 df-rn 5688 df-res 5689 df-ima 5690 df-pred 6305 df-ord 6372 df-on 6373 df-lim 6374 df-suc 6375 df-iota 6499 df-fun 6549 df-fn 6550 df-f 6551 df-f1 6552 df-fo 6553 df-f1o 6554 df-fv 6555 df-riota 7373 df-ov 7420 df-oprab 7421 df-mpo 7422 df-om 7870 df-1st 7992 df-2nd 7993 df-frecs 8285 df-wrecs 8316 df-recs 8390 df-rdg 8429 df-1o 8485 df-er 8723 df-map 8845 df-en 8963 df-dom 8964 df-sdom 8965 df-fin 8966 df-pnf 11280 df-mnf 11281 df-xr 11282 df-ltxr 11283 df-le 11284 df-sub 11476 df-neg 11477 df-nn 12243 df-2 12305 df-3 12306 df-4 12307 df-5 12308 df-6 12309 df-7 12310 df-8 12311 df-9 12312 df-n0 12503 df-z 12589 df-dec 12708 df-uz 12853 df-fz 13517 df-struct 17115 df-sets 17132 df-slot 17150 df-ndx 17162 df-base 17180 df-ress 17209 df-plusg 17245 df-hom 17256 df-cco 17257 df-0g 17422 df-cat 17647 df-cid 17648 df-resc 17793 df-estrc 18112 df-mgm 18599 df-sgrp 18678 df-mnd 18694 df-mhm 18739 df-grp 18897 df-ghm 19172 df-mgp 20079 df-ur 20126 df-ring 20179 df-rhm 20415 df-ringc 20583

This theorem is referenced by: rhmsubcsetc 20599

W3C validator